/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix010_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:23:08,202 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:23:08,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:23:08,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:23:08,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:23:08,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:23:08,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:23:08,222 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:23:08,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:23:08,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:23:08,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:23:08,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:23:08,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:23:08,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:23:08,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:23:08,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:23:08,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:23:08,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:23:08,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:23:08,235 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:23:08,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:23:08,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:23:08,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:23:08,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:23:08,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:23:08,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:23:08,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:23:08,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:23:08,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:23:08,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:23:08,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:23:08,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:23:08,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:23:08,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:23:08,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:23:08,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:23:08,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:23:08,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:23:08,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:23:08,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:23:08,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:23:08,252 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:23:08,276 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:23:08,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:23:08,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:23:08,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:23:08,278 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:23:08,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:23:08,279 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:23:08,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:23:08,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:23:08,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:23:08,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:23:08,280 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:23:08,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:23:08,281 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:23:08,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:23:08,281 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:23:08,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:23:08,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:23:08,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:23:08,282 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:23:08,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:23:08,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:23:08,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:23:08,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:23:08,284 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:23:08,284 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:23:08,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:23:08,284 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:23:08,284 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:23:08,285 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:23:08,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:23:08,572 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:23:08,576 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:23:08,577 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:23:08,578 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:23:08,579 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_power.oepc.i [2019-12-18 12:23:08,637 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f72e9c28/50e4b014801a47d78a039a84ee0d1305/FLAG2efa3539b [2019-12-18 12:23:09,170 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:23:09,170 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_power.oepc.i [2019-12-18 12:23:09,185 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f72e9c28/50e4b014801a47d78a039a84ee0d1305/FLAG2efa3539b [2019-12-18 12:23:09,468 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f72e9c28/50e4b014801a47d78a039a84ee0d1305 [2019-12-18 12:23:09,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:23:09,482 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:23:09,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:23:09,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:23:09,489 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:23:09,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:23:09" (1/1) ... [2019-12-18 12:23:09,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d61e7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:09, skipping insertion in model container [2019-12-18 12:23:09,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:23:09" (1/1) ... [2019-12-18 12:23:09,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:23:09,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:23:10,118 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:23:10,132 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:23:10,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:23:10,299 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:23:10,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:10 WrapperNode [2019-12-18 12:23:10,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:23:10,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:23:10,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:23:10,301 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:23:10,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:10" (1/1) ... [2019-12-18 12:23:10,332 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:10" (1/1) ... [2019-12-18 12:23:10,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:23:10,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:23:10,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:23:10,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:23:10,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:10" (1/1) ... [2019-12-18 12:23:10,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:10" (1/1) ... [2019-12-18 12:23:10,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:10" (1/1) ... [2019-12-18 12:23:10,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:10" (1/1) ... [2019-12-18 12:23:10,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:10" (1/1) ... [2019-12-18 12:23:10,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:10" (1/1) ... [2019-12-18 12:23:10,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:10" (1/1) ... [2019-12-18 12:23:10,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:23:10,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:23:10,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:23:10,409 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:23:10,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:23:10,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:23:10,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:23:10,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:23:10,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:23:10,474 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:23:10,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:23:10,474 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:23:10,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:23:10,475 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:23:10,475 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:23:10,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:23:10,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:23:10,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:23:10,477 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:23:11,268 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:23:11,269 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:23:11,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:23:11 BoogieIcfgContainer [2019-12-18 12:23:11,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:23:11,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:23:11,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:23:11,275 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:23:11,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:23:09" (1/3) ... [2019-12-18 12:23:11,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8eb4157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:23:11, skipping insertion in model container [2019-12-18 12:23:11,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:10" (2/3) ... [2019-12-18 12:23:11,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8eb4157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:23:11, skipping insertion in model container [2019-12-18 12:23:11,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:23:11" (3/3) ... [2019-12-18 12:23:11,279 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_power.oepc.i [2019-12-18 12:23:11,290 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:23:11,290 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:23:11,298 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:23:11,300 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:23:11,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,343 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,343 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,343 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,344 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,344 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,357 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,358 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,391 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,391 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,439 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,441 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,455 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,455 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,455 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,458 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,458 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:11,481 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:23:11,498 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:23:11,498 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:23:11,499 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:23:11,499 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:23:11,499 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:23:11,499 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:23:11,499 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:23:11,499 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:23:11,514 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-18 12:23:11,515 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 12:23:11,606 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 12:23:11,606 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:23:11,626 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:23:11,655 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 12:23:11,705 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 12:23:11,705 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:23:11,716 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:23:11,737 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:23:11,738 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:23:16,570 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-18 12:23:16,995 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 12:23:17,126 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 12:23:17,165 INFO L206 etLargeBlockEncoding]: Checked pairs total: 91218 [2019-12-18 12:23:17,165 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 12:23:17,169 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 105 transitions [2019-12-18 12:23:39,418 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-18 12:23:39,420 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-18 12:23:39,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:23:39,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:23:39,426 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:23:39,426 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:23:39,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:23:39,433 INFO L82 PathProgramCache]: Analyzing trace with hash 921826, now seen corresponding path program 1 times [2019-12-18 12:23:39,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:23:39,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329404334] [2019-12-18 12:23:39,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:23:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:23:39,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:23:39,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329404334] [2019-12-18 12:23:39,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:23:39,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:23:39,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663243789] [2019-12-18 12:23:39,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:23:39,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:23:39,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:23:39,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:23:39,679 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-18 12:23:43,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:23:43,468 INFO L93 Difference]: Finished difference Result 125226 states and 534182 transitions. [2019-12-18 12:23:43,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:23:43,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:23:43,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:23:44,218 INFO L225 Difference]: With dead ends: 125226 [2019-12-18 12:23:44,219 INFO L226 Difference]: Without dead ends: 117946 [2019-12-18 12:23:44,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:23:49,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117946 states. [2019-12-18 12:23:52,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117946 to 117946. [2019-12-18 12:23:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117946 states. [2019-12-18 12:23:53,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117946 states to 117946 states and 502500 transitions. [2019-12-18 12:23:53,014 INFO L78 Accepts]: Start accepts. Automaton has 117946 states and 502500 transitions. Word has length 3 [2019-12-18 12:23:53,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:23:53,015 INFO L462 AbstractCegarLoop]: Abstraction has 117946 states and 502500 transitions. [2019-12-18 12:23:53,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:23:53,015 INFO L276 IsEmpty]: Start isEmpty. Operand 117946 states and 502500 transitions. [2019-12-18 12:23:53,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:23:53,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:23:53,019 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:23:53,020 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:23:53,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:23:53,020 INFO L82 PathProgramCache]: Analyzing trace with hash -2034548154, now seen corresponding path program 1 times [2019-12-18 12:23:53,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:23:53,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054454688] [2019-12-18 12:23:53,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:23:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:23:53,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:23:53,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054454688] [2019-12-18 12:23:53,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:23:53,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:23:53,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053830331] [2019-12-18 12:23:53,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:23:53,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:23:53,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:23:53,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:23:53,125 INFO L87 Difference]: Start difference. First operand 117946 states and 502500 transitions. Second operand 4 states. [2019-12-18 12:23:58,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:23:58,095 INFO L93 Difference]: Finished difference Result 183040 states and 750092 transitions. [2019-12-18 12:23:58,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:23:58,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:23:58,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:23:59,700 INFO L225 Difference]: With dead ends: 183040 [2019-12-18 12:23:59,701 INFO L226 Difference]: Without dead ends: 182991 [2019-12-18 12:23:59,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:24:06,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182991 states. [2019-12-18 12:24:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182991 to 168271. [2019-12-18 12:24:14,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168271 states. [2019-12-18 12:24:15,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168271 states to 168271 states and 697811 transitions. [2019-12-18 12:24:15,477 INFO L78 Accepts]: Start accepts. Automaton has 168271 states and 697811 transitions. Word has length 11 [2019-12-18 12:24:15,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:15,477 INFO L462 AbstractCegarLoop]: Abstraction has 168271 states and 697811 transitions. [2019-12-18 12:24:15,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:24:15,478 INFO L276 IsEmpty]: Start isEmpty. Operand 168271 states and 697811 transitions. [2019-12-18 12:24:15,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:24:15,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:15,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:15,485 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:15,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:15,486 INFO L82 PathProgramCache]: Analyzing trace with hash -579003435, now seen corresponding path program 1 times [2019-12-18 12:24:15,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:15,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544344210] [2019-12-18 12:24:15,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:15,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544344210] [2019-12-18 12:24:15,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:15,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:24:15,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352814409] [2019-12-18 12:24:15,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:24:15,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:15,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:24:15,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:24:15,564 INFO L87 Difference]: Start difference. First operand 168271 states and 697811 transitions. Second operand 3 states. [2019-12-18 12:24:15,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:15,748 INFO L93 Difference]: Finished difference Result 35531 states and 115505 transitions. [2019-12-18 12:24:15,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:24:15,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:24:15,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:15,805 INFO L225 Difference]: With dead ends: 35531 [2019-12-18 12:24:15,806 INFO L226 Difference]: Without dead ends: 35531 [2019-12-18 12:24:15,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:24:21,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35531 states. [2019-12-18 12:24:21,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35531 to 35531. [2019-12-18 12:24:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35531 states. [2019-12-18 12:24:21,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35531 states to 35531 states and 115505 transitions. [2019-12-18 12:24:21,468 INFO L78 Accepts]: Start accepts. Automaton has 35531 states and 115505 transitions. Word has length 13 [2019-12-18 12:24:21,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:21,468 INFO L462 AbstractCegarLoop]: Abstraction has 35531 states and 115505 transitions. [2019-12-18 12:24:21,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:24:21,468 INFO L276 IsEmpty]: Start isEmpty. Operand 35531 states and 115505 transitions. [2019-12-18 12:24:21,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:24:21,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:21,472 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:21,473 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:21,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:21,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1458626840, now seen corresponding path program 1 times [2019-12-18 12:24:21,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:21,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845998965] [2019-12-18 12:24:21,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:21,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:21,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845998965] [2019-12-18 12:24:21,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:21,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:24:21,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875023345] [2019-12-18 12:24:21,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:24:21,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:21,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:24:21,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:24:21,569 INFO L87 Difference]: Start difference. First operand 35531 states and 115505 transitions. Second operand 5 states. [2019-12-18 12:24:22,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:22,132 INFO L93 Difference]: Finished difference Result 49606 states and 159424 transitions. [2019-12-18 12:24:22,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:24:22,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 12:24:22,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:22,216 INFO L225 Difference]: With dead ends: 49606 [2019-12-18 12:24:22,216 INFO L226 Difference]: Without dead ends: 49606 [2019-12-18 12:24:22,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:24:22,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49606 states. [2019-12-18 12:24:23,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49606 to 42335. [2019-12-18 12:24:23,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42335 states. [2019-12-18 12:24:23,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42335 states to 42335 states and 137188 transitions. [2019-12-18 12:24:23,504 INFO L78 Accepts]: Start accepts. Automaton has 42335 states and 137188 transitions. Word has length 16 [2019-12-18 12:24:23,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:23,505 INFO L462 AbstractCegarLoop]: Abstraction has 42335 states and 137188 transitions. [2019-12-18 12:24:23,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:24:23,505 INFO L276 IsEmpty]: Start isEmpty. Operand 42335 states and 137188 transitions. [2019-12-18 12:24:23,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:24:23,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:23,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:23,516 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:23,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:23,517 INFO L82 PathProgramCache]: Analyzing trace with hash -311730194, now seen corresponding path program 1 times [2019-12-18 12:24:23,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:23,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029549027] [2019-12-18 12:24:23,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:23,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:23,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029549027] [2019-12-18 12:24:23,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:23,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:24:23,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350724672] [2019-12-18 12:24:23,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:24:23,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:23,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:24:23,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:24:23,684 INFO L87 Difference]: Start difference. First operand 42335 states and 137188 transitions. Second operand 7 states. [2019-12-18 12:24:24,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:24,681 INFO L93 Difference]: Finished difference Result 68217 states and 214442 transitions. [2019-12-18 12:24:24,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:24:24,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-18 12:24:24,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:24,787 INFO L225 Difference]: With dead ends: 68217 [2019-12-18 12:24:24,787 INFO L226 Difference]: Without dead ends: 68203 [2019-12-18 12:24:24,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:24:25,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68203 states. [2019-12-18 12:24:25,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68203 to 42009. [2019-12-18 12:24:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42009 states. [2019-12-18 12:24:25,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42009 states to 42009 states and 135594 transitions. [2019-12-18 12:24:25,708 INFO L78 Accepts]: Start accepts. Automaton has 42009 states and 135594 transitions. Word has length 22 [2019-12-18 12:24:25,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:25,708 INFO L462 AbstractCegarLoop]: Abstraction has 42009 states and 135594 transitions. [2019-12-18 12:24:25,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:24:25,708 INFO L276 IsEmpty]: Start isEmpty. Operand 42009 states and 135594 transitions. [2019-12-18 12:24:25,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:24:25,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:25,724 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:25,724 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:25,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:25,725 INFO L82 PathProgramCache]: Analyzing trace with hash 573582081, now seen corresponding path program 1 times [2019-12-18 12:24:25,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:25,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502087842] [2019-12-18 12:24:25,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:25,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502087842] [2019-12-18 12:24:25,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:25,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:24:25,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920303581] [2019-12-18 12:24:25,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:24:25,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:25,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:24:25,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:24:25,775 INFO L87 Difference]: Start difference. First operand 42009 states and 135594 transitions. Second operand 4 states. [2019-12-18 12:24:25,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:25,839 INFO L93 Difference]: Finished difference Result 16636 states and 50803 transitions. [2019-12-18 12:24:25,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:24:25,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:24:25,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:25,862 INFO L225 Difference]: With dead ends: 16636 [2019-12-18 12:24:25,862 INFO L226 Difference]: Without dead ends: 16636 [2019-12-18 12:24:25,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:24:25,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16636 states. [2019-12-18 12:24:26,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16636 to 16378. [2019-12-18 12:24:26,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16378 states. [2019-12-18 12:24:26,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16378 states to 16378 states and 50067 transitions. [2019-12-18 12:24:26,451 INFO L78 Accepts]: Start accepts. Automaton has 16378 states and 50067 transitions. Word has length 25 [2019-12-18 12:24:26,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:26,451 INFO L462 AbstractCegarLoop]: Abstraction has 16378 states and 50067 transitions. [2019-12-18 12:24:26,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:24:26,452 INFO L276 IsEmpty]: Start isEmpty. Operand 16378 states and 50067 transitions. [2019-12-18 12:24:26,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:24:26,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:26,463 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:26,464 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:26,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:26,464 INFO L82 PathProgramCache]: Analyzing trace with hash 574668024, now seen corresponding path program 1 times [2019-12-18 12:24:26,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:26,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052096236] [2019-12-18 12:24:26,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:26,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052096236] [2019-12-18 12:24:26,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:26,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:24:26,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630665633] [2019-12-18 12:24:26,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:24:26,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:26,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:24:26,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:24:26,577 INFO L87 Difference]: Start difference. First operand 16378 states and 50067 transitions. Second operand 6 states. [2019-12-18 12:24:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:27,092 INFO L93 Difference]: Finished difference Result 23754 states and 70239 transitions. [2019-12-18 12:24:27,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:24:27,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 12:24:27,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:27,127 INFO L225 Difference]: With dead ends: 23754 [2019-12-18 12:24:27,127 INFO L226 Difference]: Without dead ends: 23754 [2019-12-18 12:24:27,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:24:27,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23754 states. [2019-12-18 12:24:27,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23754 to 19127. [2019-12-18 12:24:27,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19127 states. [2019-12-18 12:24:27,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19127 states to 19127 states and 57723 transitions. [2019-12-18 12:24:27,448 INFO L78 Accepts]: Start accepts. Automaton has 19127 states and 57723 transitions. Word has length 27 [2019-12-18 12:24:27,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:27,448 INFO L462 AbstractCegarLoop]: Abstraction has 19127 states and 57723 transitions. [2019-12-18 12:24:27,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:24:27,448 INFO L276 IsEmpty]: Start isEmpty. Operand 19127 states and 57723 transitions. [2019-12-18 12:24:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:24:27,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:27,468 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:27,468 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:27,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:27,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1393723506, now seen corresponding path program 1 times [2019-12-18 12:24:27,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:27,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385057721] [2019-12-18 12:24:27,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:27,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:27,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385057721] [2019-12-18 12:24:27,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:27,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:24:27,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025920223] [2019-12-18 12:24:27,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:24:27,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:27,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:24:27,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:24:27,540 INFO L87 Difference]: Start difference. First operand 19127 states and 57723 transitions. Second operand 5 states. [2019-12-18 12:24:27,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:27,922 INFO L93 Difference]: Finished difference Result 23902 states and 71215 transitions. [2019-12-18 12:24:27,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:24:27,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-18 12:24:27,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:27,966 INFO L225 Difference]: With dead ends: 23902 [2019-12-18 12:24:27,966 INFO L226 Difference]: Without dead ends: 23902 [2019-12-18 12:24:27,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:24:28,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23902 states. [2019-12-18 12:24:28,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23902 to 20179. [2019-12-18 12:24:28,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20179 states. [2019-12-18 12:24:28,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20179 states to 20179 states and 61180 transitions. [2019-12-18 12:24:28,302 INFO L78 Accepts]: Start accepts. Automaton has 20179 states and 61180 transitions. Word has length 33 [2019-12-18 12:24:28,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:28,302 INFO L462 AbstractCegarLoop]: Abstraction has 20179 states and 61180 transitions. [2019-12-18 12:24:28,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:24:28,303 INFO L276 IsEmpty]: Start isEmpty. Operand 20179 states and 61180 transitions. [2019-12-18 12:24:28,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:24:28,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:28,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:28,325 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:28,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:28,326 INFO L82 PathProgramCache]: Analyzing trace with hash 305072172, now seen corresponding path program 2 times [2019-12-18 12:24:28,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:28,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952281106] [2019-12-18 12:24:28,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:28,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:28,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952281106] [2019-12-18 12:24:28,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:28,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:24:28,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516014007] [2019-12-18 12:24:28,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:24:28,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:28,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:24:28,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:24:28,444 INFO L87 Difference]: Start difference. First operand 20179 states and 61180 transitions. Second operand 8 states. [2019-12-18 12:24:29,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:29,794 INFO L93 Difference]: Finished difference Result 27626 states and 80996 transitions. [2019-12-18 12:24:29,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:24:29,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 12:24:29,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:29,839 INFO L225 Difference]: With dead ends: 27626 [2019-12-18 12:24:29,839 INFO L226 Difference]: Without dead ends: 27626 [2019-12-18 12:24:29,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:24:29,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27626 states. [2019-12-18 12:24:30,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27626 to 17400. [2019-12-18 12:24:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17400 states. [2019-12-18 12:24:30,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17400 states to 17400 states and 52480 transitions. [2019-12-18 12:24:30,449 INFO L78 Accepts]: Start accepts. Automaton has 17400 states and 52480 transitions. Word has length 33 [2019-12-18 12:24:30,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:30,449 INFO L462 AbstractCegarLoop]: Abstraction has 17400 states and 52480 transitions. [2019-12-18 12:24:30,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:24:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 17400 states and 52480 transitions. [2019-12-18 12:24:30,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:24:30,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:30,471 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:30,471 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:30,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:30,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1779229683, now seen corresponding path program 1 times [2019-12-18 12:24:30,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:30,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570837727] [2019-12-18 12:24:30,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:30,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:30,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570837727] [2019-12-18 12:24:30,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:30,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:24:30,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819281041] [2019-12-18 12:24:30,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:24:30,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:30,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:24:30,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:24:30,529 INFO L87 Difference]: Start difference. First operand 17400 states and 52480 transitions. Second operand 3 states. [2019-12-18 12:24:30,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:30,599 INFO L93 Difference]: Finished difference Result 17399 states and 52478 transitions. [2019-12-18 12:24:30,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:24:30,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:24:30,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:30,636 INFO L225 Difference]: With dead ends: 17399 [2019-12-18 12:24:30,637 INFO L226 Difference]: Without dead ends: 17399 [2019-12-18 12:24:30,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:24:30,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17399 states. [2019-12-18 12:24:31,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17399 to 17399. [2019-12-18 12:24:31,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17399 states. [2019-12-18 12:24:31,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17399 states to 17399 states and 52478 transitions. [2019-12-18 12:24:31,051 INFO L78 Accepts]: Start accepts. Automaton has 17399 states and 52478 transitions. Word has length 39 [2019-12-18 12:24:31,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:31,052 INFO L462 AbstractCegarLoop]: Abstraction has 17399 states and 52478 transitions. [2019-12-18 12:24:31,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:24:31,052 INFO L276 IsEmpty]: Start isEmpty. Operand 17399 states and 52478 transitions. [2019-12-18 12:24:31,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:24:31,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:31,078 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:31,078 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:31,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:31,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1175786798, now seen corresponding path program 1 times [2019-12-18 12:24:31,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:31,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340665705] [2019-12-18 12:24:31,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:31,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340665705] [2019-12-18 12:24:31,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:31,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:24:31,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5794920] [2019-12-18 12:24:31,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:24:31,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:31,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:24:31,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:24:31,168 INFO L87 Difference]: Start difference. First operand 17399 states and 52478 transitions. Second operand 6 states. [2019-12-18 12:24:32,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:32,113 INFO L93 Difference]: Finished difference Result 34243 states and 103303 transitions. [2019-12-18 12:24:32,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:24:32,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 12:24:32,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:32,165 INFO L225 Difference]: With dead ends: 34243 [2019-12-18 12:24:32,165 INFO L226 Difference]: Without dead ends: 34243 [2019-12-18 12:24:32,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:24:32,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34243 states. [2019-12-18 12:24:32,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34243 to 22015. [2019-12-18 12:24:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22015 states. [2019-12-18 12:24:32,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22015 states to 22015 states and 66470 transitions. [2019-12-18 12:24:32,614 INFO L78 Accepts]: Start accepts. Automaton has 22015 states and 66470 transitions. Word has length 40 [2019-12-18 12:24:32,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:32,614 INFO L462 AbstractCegarLoop]: Abstraction has 22015 states and 66470 transitions. [2019-12-18 12:24:32,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:24:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 22015 states and 66470 transitions. [2019-12-18 12:24:32,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:24:32,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:32,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:32,642 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:32,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:32,642 INFO L82 PathProgramCache]: Analyzing trace with hash -93454286, now seen corresponding path program 2 times [2019-12-18 12:24:32,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:32,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739716822] [2019-12-18 12:24:32,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:32,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:32,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739716822] [2019-12-18 12:24:32,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:32,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:24:32,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716739580] [2019-12-18 12:24:32,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:24:32,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:32,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:24:32,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:24:32,735 INFO L87 Difference]: Start difference. First operand 22015 states and 66470 transitions. Second operand 5 states. [2019-12-18 12:24:33,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:33,436 INFO L93 Difference]: Finished difference Result 30046 states and 90242 transitions. [2019-12-18 12:24:33,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:24:33,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:24:33,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:33,479 INFO L225 Difference]: With dead ends: 30046 [2019-12-18 12:24:33,479 INFO L226 Difference]: Without dead ends: 30046 [2019-12-18 12:24:33,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:24:33,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30046 states. [2019-12-18 12:24:34,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30046 to 26807. [2019-12-18 12:24:34,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26807 states. [2019-12-18 12:24:34,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26807 states to 26807 states and 81221 transitions. [2019-12-18 12:24:34,173 INFO L78 Accepts]: Start accepts. Automaton has 26807 states and 81221 transitions. Word has length 40 [2019-12-18 12:24:34,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:34,173 INFO L462 AbstractCegarLoop]: Abstraction has 26807 states and 81221 transitions. [2019-12-18 12:24:34,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:24:34,174 INFO L276 IsEmpty]: Start isEmpty. Operand 26807 states and 81221 transitions. [2019-12-18 12:24:34,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:24:34,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:34,210 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:34,211 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:34,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:34,211 INFO L82 PathProgramCache]: Analyzing trace with hash 152430908, now seen corresponding path program 3 times [2019-12-18 12:24:34,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:34,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188792242] [2019-12-18 12:24:34,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:34,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:34,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188792242] [2019-12-18 12:24:34,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:34,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:24:34,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775639899] [2019-12-18 12:24:34,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:24:34,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:34,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:24:34,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:24:34,273 INFO L87 Difference]: Start difference. First operand 26807 states and 81221 transitions. Second operand 5 states. [2019-12-18 12:24:34,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:34,396 INFO L93 Difference]: Finished difference Result 25470 states and 78136 transitions. [2019-12-18 12:24:34,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:24:34,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:24:34,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:34,441 INFO L225 Difference]: With dead ends: 25470 [2019-12-18 12:24:34,441 INFO L226 Difference]: Without dead ends: 25470 [2019-12-18 12:24:34,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:24:34,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25470 states. [2019-12-18 12:24:34,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25470 to 24504. [2019-12-18 12:24:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24504 states. [2019-12-18 12:24:34,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24504 states to 24504 states and 75530 transitions. [2019-12-18 12:24:34,811 INFO L78 Accepts]: Start accepts. Automaton has 24504 states and 75530 transitions. Word has length 40 [2019-12-18 12:24:34,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:34,811 INFO L462 AbstractCegarLoop]: Abstraction has 24504 states and 75530 transitions. [2019-12-18 12:24:34,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:24:34,812 INFO L276 IsEmpty]: Start isEmpty. Operand 24504 states and 75530 transitions. [2019-12-18 12:24:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:24:34,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:34,842 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:34,842 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:34,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:34,843 INFO L82 PathProgramCache]: Analyzing trace with hash 974609302, now seen corresponding path program 1 times [2019-12-18 12:24:34,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:34,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562646164] [2019-12-18 12:24:34,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:34,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:34,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562646164] [2019-12-18 12:24:34,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:34,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:24:34,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009995637] [2019-12-18 12:24:34,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:24:34,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:34,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:24:34,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:24:34,892 INFO L87 Difference]: Start difference. First operand 24504 states and 75530 transitions. Second operand 3 states. [2019-12-18 12:24:35,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:35,062 INFO L93 Difference]: Finished difference Result 34625 states and 106821 transitions. [2019-12-18 12:24:35,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:24:35,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:24:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:35,108 INFO L225 Difference]: With dead ends: 34625 [2019-12-18 12:24:35,108 INFO L226 Difference]: Without dead ends: 34625 [2019-12-18 12:24:35,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:24:35,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34625 states. [2019-12-18 12:24:35,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34625 to 27128. [2019-12-18 12:24:35,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27128 states. [2019-12-18 12:24:35,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27128 states to 27128 states and 84304 transitions. [2019-12-18 12:24:35,559 INFO L78 Accepts]: Start accepts. Automaton has 27128 states and 84304 transitions. Word has length 64 [2019-12-18 12:24:35,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:35,560 INFO L462 AbstractCegarLoop]: Abstraction has 27128 states and 84304 transitions. [2019-12-18 12:24:35,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:24:35,560 INFO L276 IsEmpty]: Start isEmpty. Operand 27128 states and 84304 transitions. [2019-12-18 12:24:35,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:24:35,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:35,587 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:35,587 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:35,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:35,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1487362447, now seen corresponding path program 1 times [2019-12-18 12:24:35,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:35,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558248514] [2019-12-18 12:24:35,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:35,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558248514] [2019-12-18 12:24:35,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:35,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:24:35,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180248089] [2019-12-18 12:24:35,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:24:35,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:35,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:24:35,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:24:35,674 INFO L87 Difference]: Start difference. First operand 27128 states and 84304 transitions. Second operand 7 states. [2019-12-18 12:24:36,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:36,263 INFO L93 Difference]: Finished difference Result 73273 states and 226524 transitions. [2019-12-18 12:24:36,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:24:36,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:24:36,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:36,741 INFO L225 Difference]: With dead ends: 73273 [2019-12-18 12:24:36,742 INFO L226 Difference]: Without dead ends: 55201 [2019-12-18 12:24:36,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:24:36,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55201 states. [2019-12-18 12:24:37,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55201 to 31445. [2019-12-18 12:24:37,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31445 states. [2019-12-18 12:24:37,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31445 states to 31445 states and 97708 transitions. [2019-12-18 12:24:37,396 INFO L78 Accepts]: Start accepts. Automaton has 31445 states and 97708 transitions. Word has length 64 [2019-12-18 12:24:37,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:37,396 INFO L462 AbstractCegarLoop]: Abstraction has 31445 states and 97708 transitions. [2019-12-18 12:24:37,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:24:37,396 INFO L276 IsEmpty]: Start isEmpty. Operand 31445 states and 97708 transitions. [2019-12-18 12:24:37,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:24:37,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:37,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:37,431 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:37,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:37,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1007546921, now seen corresponding path program 2 times [2019-12-18 12:24:37,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:37,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127279795] [2019-12-18 12:24:37,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:37,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:37,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127279795] [2019-12-18 12:24:37,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:37,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:24:37,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140340716] [2019-12-18 12:24:37,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:24:37,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:37,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:24:37,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:24:37,524 INFO L87 Difference]: Start difference. First operand 31445 states and 97708 transitions. Second operand 7 states. [2019-12-18 12:24:38,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:38,110 INFO L93 Difference]: Finished difference Result 81140 states and 248111 transitions. [2019-12-18 12:24:38,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:24:38,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:24:38,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:38,201 INFO L225 Difference]: With dead ends: 81140 [2019-12-18 12:24:38,201 INFO L226 Difference]: Without dead ends: 57495 [2019-12-18 12:24:38,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:24:38,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57495 states. [2019-12-18 12:24:38,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57495 to 35246. [2019-12-18 12:24:38,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35246 states. [2019-12-18 12:24:38,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35246 states to 35246 states and 109148 transitions. [2019-12-18 12:24:38,993 INFO L78 Accepts]: Start accepts. Automaton has 35246 states and 109148 transitions. Word has length 64 [2019-12-18 12:24:38,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:38,994 INFO L462 AbstractCegarLoop]: Abstraction has 35246 states and 109148 transitions. [2019-12-18 12:24:38,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:24:38,994 INFO L276 IsEmpty]: Start isEmpty. Operand 35246 states and 109148 transitions. [2019-12-18 12:24:39,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:24:39,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:39,039 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:39,039 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:39,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:39,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1228276157, now seen corresponding path program 3 times [2019-12-18 12:24:39,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:39,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476056353] [2019-12-18 12:24:39,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:39,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476056353] [2019-12-18 12:24:39,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:39,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:24:39,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934919485] [2019-12-18 12:24:39,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:24:39,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:39,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:24:39,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:24:39,150 INFO L87 Difference]: Start difference. First operand 35246 states and 109148 transitions. Second operand 8 states. [2019-12-18 12:24:39,714 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-18 12:24:40,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:40,557 INFO L93 Difference]: Finished difference Result 98595 states and 302496 transitions. [2019-12-18 12:24:40,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 12:24:40,558 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 12:24:40,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:40,694 INFO L225 Difference]: With dead ends: 98595 [2019-12-18 12:24:40,694 INFO L226 Difference]: Without dead ends: 87943 [2019-12-18 12:24:40,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:24:40,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87943 states. [2019-12-18 12:24:41,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87943 to 35744. [2019-12-18 12:24:41,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35744 states. [2019-12-18 12:24:41,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35744 states to 35744 states and 111048 transitions. [2019-12-18 12:24:41,734 INFO L78 Accepts]: Start accepts. Automaton has 35744 states and 111048 transitions. Word has length 64 [2019-12-18 12:24:41,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:41,734 INFO L462 AbstractCegarLoop]: Abstraction has 35744 states and 111048 transitions. [2019-12-18 12:24:41,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:24:41,734 INFO L276 IsEmpty]: Start isEmpty. Operand 35744 states and 111048 transitions. [2019-12-18 12:24:41,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:24:41,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:41,770 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:41,770 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:41,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:41,770 INFO L82 PathProgramCache]: Analyzing trace with hash -2056816817, now seen corresponding path program 4 times [2019-12-18 12:24:41,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:41,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407883344] [2019-12-18 12:24:41,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:41,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:41,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407883344] [2019-12-18 12:24:41,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:41,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:24:41,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361632026] [2019-12-18 12:24:41,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:24:41,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:41,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:24:41,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:24:41,867 INFO L87 Difference]: Start difference. First operand 35744 states and 111048 transitions. Second operand 9 states. [2019-12-18 12:24:44,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:44,204 INFO L93 Difference]: Finished difference Result 119468 states and 363005 transitions. [2019-12-18 12:24:44,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 12:24:44,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:24:44,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:44,357 INFO L225 Difference]: With dead ends: 119468 [2019-12-18 12:24:44,357 INFO L226 Difference]: Without dead ends: 105156 [2019-12-18 12:24:44,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:24:44,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105156 states. [2019-12-18 12:24:45,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105156 to 35780. [2019-12-18 12:24:45,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35780 states. [2019-12-18 12:24:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35780 states to 35780 states and 111205 transitions. [2019-12-18 12:24:45,547 INFO L78 Accepts]: Start accepts. Automaton has 35780 states and 111205 transitions. Word has length 64 [2019-12-18 12:24:45,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:45,547 INFO L462 AbstractCegarLoop]: Abstraction has 35780 states and 111205 transitions. [2019-12-18 12:24:45,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:24:45,548 INFO L276 IsEmpty]: Start isEmpty. Operand 35780 states and 111205 transitions. [2019-12-18 12:24:45,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:24:45,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:45,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:45,588 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:45,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:45,588 INFO L82 PathProgramCache]: Analyzing trace with hash 836129701, now seen corresponding path program 5 times [2019-12-18 12:24:45,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:45,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11272470] [2019-12-18 12:24:45,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:45,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:45,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11272470] [2019-12-18 12:24:45,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:45,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:24:45,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215958773] [2019-12-18 12:24:45,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:24:45,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:45,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:24:45,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:24:45,705 INFO L87 Difference]: Start difference. First operand 35780 states and 111205 transitions. Second operand 9 states. [2019-12-18 12:24:47,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:47,186 INFO L93 Difference]: Finished difference Result 131669 states and 399951 transitions. [2019-12-18 12:24:47,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 12:24:47,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:24:47,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:47,370 INFO L225 Difference]: With dead ends: 131669 [2019-12-18 12:24:47,370 INFO L226 Difference]: Without dead ends: 121803 [2019-12-18 12:24:47,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=635, Unknown=0, NotChecked=0, Total=870 [2019-12-18 12:24:48,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121803 states. [2019-12-18 12:24:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121803 to 35817. [2019-12-18 12:24:48,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35817 states. [2019-12-18 12:24:49,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35817 states to 35817 states and 111367 transitions. [2019-12-18 12:24:49,039 INFO L78 Accepts]: Start accepts. Automaton has 35817 states and 111367 transitions. Word has length 64 [2019-12-18 12:24:49,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:49,039 INFO L462 AbstractCegarLoop]: Abstraction has 35817 states and 111367 transitions. [2019-12-18 12:24:49,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:24:49,039 INFO L276 IsEmpty]: Start isEmpty. Operand 35817 states and 111367 transitions. [2019-12-18 12:24:49,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:24:49,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:49,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:49,076 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:49,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:49,076 INFO L82 PathProgramCache]: Analyzing trace with hash -17789391, now seen corresponding path program 6 times [2019-12-18 12:24:49,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:49,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9030009] [2019-12-18 12:24:49,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:49,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9030009] [2019-12-18 12:24:49,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:49,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:24:49,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781534035] [2019-12-18 12:24:49,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:24:49,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:49,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:24:49,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:24:49,130 INFO L87 Difference]: Start difference. First operand 35817 states and 111367 transitions. Second operand 3 states. [2019-12-18 12:24:49,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:49,366 INFO L93 Difference]: Finished difference Result 42547 states and 131537 transitions. [2019-12-18 12:24:49,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:24:49,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:24:49,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:49,450 INFO L225 Difference]: With dead ends: 42547 [2019-12-18 12:24:49,451 INFO L226 Difference]: Without dead ends: 42547 [2019-12-18 12:24:49,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:24:49,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42547 states. [2019-12-18 12:24:49,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42547 to 37071. [2019-12-18 12:24:49,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37071 states. [2019-12-18 12:24:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37071 states to 37071 states and 115326 transitions. [2019-12-18 12:24:50,064 INFO L78 Accepts]: Start accepts. Automaton has 37071 states and 115326 transitions. Word has length 64 [2019-12-18 12:24:50,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:50,064 INFO L462 AbstractCegarLoop]: Abstraction has 37071 states and 115326 transitions. [2019-12-18 12:24:50,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:24:50,064 INFO L276 IsEmpty]: Start isEmpty. Operand 37071 states and 115326 transitions. [2019-12-18 12:24:50,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:24:50,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:50,104 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:50,104 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:50,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:50,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1046831716, now seen corresponding path program 1 times [2019-12-18 12:24:50,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:50,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331823581] [2019-12-18 12:24:50,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:50,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:50,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331823581] [2019-12-18 12:24:50,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:50,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:24:50,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324963121] [2019-12-18 12:24:50,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:24:50,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:50,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:24:50,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:24:50,201 INFO L87 Difference]: Start difference. First operand 37071 states and 115326 transitions. Second operand 8 states. [2019-12-18 12:24:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:51,838 INFO L93 Difference]: Finished difference Result 111740 states and 339408 transitions. [2019-12-18 12:24:51,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 12:24:51,839 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 12:24:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:52,008 INFO L225 Difference]: With dead ends: 111740 [2019-12-18 12:24:52,008 INFO L226 Difference]: Without dead ends: 99733 [2019-12-18 12:24:52,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:24:52,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99733 states. [2019-12-18 12:24:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99733 to 37073. [2019-12-18 12:24:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37073 states. [2019-12-18 12:24:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37073 states to 37073 states and 115341 transitions. [2019-12-18 12:24:53,111 INFO L78 Accepts]: Start accepts. Automaton has 37073 states and 115341 transitions. Word has length 65 [2019-12-18 12:24:53,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:53,111 INFO L462 AbstractCegarLoop]: Abstraction has 37073 states and 115341 transitions. [2019-12-18 12:24:53,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:24:53,111 INFO L276 IsEmpty]: Start isEmpty. Operand 37073 states and 115341 transitions. [2019-12-18 12:24:53,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:24:53,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:53,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:53,153 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:53,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:53,153 INFO L82 PathProgramCache]: Analyzing trace with hash 501635668, now seen corresponding path program 2 times [2019-12-18 12:24:53,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:53,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707254491] [2019-12-18 12:24:53,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:53,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:53,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707254491] [2019-12-18 12:24:53,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:53,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:24:53,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244815624] [2019-12-18 12:24:53,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:24:53,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:53,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:24:53,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:24:53,266 INFO L87 Difference]: Start difference. First operand 37073 states and 115341 transitions. Second operand 9 states. [2019-12-18 12:24:54,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:54,975 INFO L93 Difference]: Finished difference Result 134194 states and 407074 transitions. [2019-12-18 12:24:54,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:24:54,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:24:54,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:55,159 INFO L225 Difference]: With dead ends: 134194 [2019-12-18 12:24:55,159 INFO L226 Difference]: Without dead ends: 122325 [2019-12-18 12:24:55,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-12-18 12:24:56,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122325 states. [2019-12-18 12:24:56,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122325 to 37029. [2019-12-18 12:24:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37029 states. [2019-12-18 12:24:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37029 states to 37029 states and 115116 transitions. [2019-12-18 12:24:56,844 INFO L78 Accepts]: Start accepts. Automaton has 37029 states and 115116 transitions. Word has length 65 [2019-12-18 12:24:56,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:56,844 INFO L462 AbstractCegarLoop]: Abstraction has 37029 states and 115116 transitions. [2019-12-18 12:24:56,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:24:56,845 INFO L276 IsEmpty]: Start isEmpty. Operand 37029 states and 115116 transitions. [2019-12-18 12:24:56,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:24:56,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:56,882 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:56,882 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:56,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:56,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1293437306, now seen corresponding path program 3 times [2019-12-18 12:24:56,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:56,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161689486] [2019-12-18 12:24:56,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:56,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:56,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161689486] [2019-12-18 12:24:56,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:56,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:24:57,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68220838] [2019-12-18 12:24:57,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:24:57,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:57,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:24:57,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:24:57,001 INFO L87 Difference]: Start difference. First operand 37029 states and 115116 transitions. Second operand 9 states. [2019-12-18 12:24:58,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:58,870 INFO L93 Difference]: Finished difference Result 153077 states and 465403 transitions. [2019-12-18 12:24:58,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 12:24:58,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:24:58,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:59,071 INFO L225 Difference]: With dead ends: 153077 [2019-12-18 12:24:59,071 INFO L226 Difference]: Without dead ends: 125434 [2019-12-18 12:24:59,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:24:59,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125434 states. [2019-12-18 12:25:00,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125434 to 40153. [2019-12-18 12:25:00,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40153 states. [2019-12-18 12:25:00,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40153 states to 40153 states and 125039 transitions. [2019-12-18 12:25:00,958 INFO L78 Accepts]: Start accepts. Automaton has 40153 states and 125039 transitions. Word has length 65 [2019-12-18 12:25:00,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:00,958 INFO L462 AbstractCegarLoop]: Abstraction has 40153 states and 125039 transitions. [2019-12-18 12:25:00,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:25:00,959 INFO L276 IsEmpty]: Start isEmpty. Operand 40153 states and 125039 transitions. [2019-12-18 12:25:01,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:01,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:01,011 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:01,011 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:01,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:01,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1980366454, now seen corresponding path program 4 times [2019-12-18 12:25:01,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:01,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719093632] [2019-12-18 12:25:01,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:01,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719093632] [2019-12-18 12:25:01,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:01,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:25:01,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341181069] [2019-12-18 12:25:01,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:25:01,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:01,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:25:01,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:25:01,126 INFO L87 Difference]: Start difference. First operand 40153 states and 125039 transitions. Second operand 7 states. [2019-12-18 12:25:02,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:02,329 INFO L93 Difference]: Finished difference Result 55596 states and 169227 transitions. [2019-12-18 12:25:02,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:25:02,330 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:25:02,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:02,450 INFO L225 Difference]: With dead ends: 55596 [2019-12-18 12:25:02,451 INFO L226 Difference]: Without dead ends: 55596 [2019-12-18 12:25:02,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:25:02,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55596 states. [2019-12-18 12:25:03,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55596 to 42525. [2019-12-18 12:25:03,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42525 states. [2019-12-18 12:25:03,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42525 states to 42525 states and 131689 transitions. [2019-12-18 12:25:03,272 INFO L78 Accepts]: Start accepts. Automaton has 42525 states and 131689 transitions. Word has length 65 [2019-12-18 12:25:03,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:03,273 INFO L462 AbstractCegarLoop]: Abstraction has 42525 states and 131689 transitions. [2019-12-18 12:25:03,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:25:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 42525 states and 131689 transitions. [2019-12-18 12:25:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:03,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:03,320 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:03,320 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:03,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:03,321 INFO L82 PathProgramCache]: Analyzing trace with hash -25014344, now seen corresponding path program 5 times [2019-12-18 12:25:03,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:03,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677009778] [2019-12-18 12:25:03,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:03,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:03,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677009778] [2019-12-18 12:25:03,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:03,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:25:03,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299283190] [2019-12-18 12:25:03,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:25:03,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:03,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:25:03,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:25:03,435 INFO L87 Difference]: Start difference. First operand 42525 states and 131689 transitions. Second operand 9 states. [2019-12-18 12:25:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:05,865 INFO L93 Difference]: Finished difference Result 66164 states and 202890 transitions. [2019-12-18 12:25:05,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:25:05,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:25:05,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:05,971 INFO L225 Difference]: With dead ends: 66164 [2019-12-18 12:25:05,971 INFO L226 Difference]: Without dead ends: 66164 [2019-12-18 12:25:05,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:25:06,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66164 states. [2019-12-18 12:25:06,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66164 to 41944. [2019-12-18 12:25:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41944 states. [2019-12-18 12:25:06,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41944 states to 41944 states and 130085 transitions. [2019-12-18 12:25:06,894 INFO L78 Accepts]: Start accepts. Automaton has 41944 states and 130085 transitions. Word has length 65 [2019-12-18 12:25:06,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:06,895 INFO L462 AbstractCegarLoop]: Abstraction has 41944 states and 130085 transitions. [2019-12-18 12:25:06,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:25:06,895 INFO L276 IsEmpty]: Start isEmpty. Operand 41944 states and 130085 transitions. [2019-12-18 12:25:06,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:06,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:06,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:06,945 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:06,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:06,946 INFO L82 PathProgramCache]: Analyzing trace with hash 373916454, now seen corresponding path program 1 times [2019-12-18 12:25:06,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:06,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060998026] [2019-12-18 12:25:06,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:07,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:07,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060998026] [2019-12-18 12:25:07,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:07,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:25:07,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289604969] [2019-12-18 12:25:07,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:25:07,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:07,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:25:07,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:25:07,136 INFO L87 Difference]: Start difference. First operand 41944 states and 130085 transitions. Second operand 10 states. [2019-12-18 12:25:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:08,949 INFO L93 Difference]: Finished difference Result 59640 states and 180401 transitions. [2019-12-18 12:25:08,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:25:08,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-18 12:25:08,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:09,047 INFO L225 Difference]: With dead ends: 59640 [2019-12-18 12:25:09,047 INFO L226 Difference]: Without dead ends: 59640 [2019-12-18 12:25:09,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2019-12-18 12:25:09,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59640 states. [2019-12-18 12:25:10,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59640 to 45198. [2019-12-18 12:25:10,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45198 states. [2019-12-18 12:25:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45198 states to 45198 states and 139652 transitions. [2019-12-18 12:25:10,351 INFO L78 Accepts]: Start accepts. Automaton has 45198 states and 139652 transitions. Word has length 65 [2019-12-18 12:25:10,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:10,351 INFO L462 AbstractCegarLoop]: Abstraction has 45198 states and 139652 transitions. [2019-12-18 12:25:10,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:25:10,351 INFO L276 IsEmpty]: Start isEmpty. Operand 45198 states and 139652 transitions. [2019-12-18 12:25:10,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:10,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:10,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:10,401 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:10,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:10,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1193547640, now seen corresponding path program 2 times [2019-12-18 12:25:10,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:10,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403523021] [2019-12-18 12:25:10,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:10,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:10,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403523021] [2019-12-18 12:25:10,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:10,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:25:10,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320036490] [2019-12-18 12:25:10,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:25:10,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:10,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:25:10,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:25:10,497 INFO L87 Difference]: Start difference. First operand 45198 states and 139652 transitions. Second operand 7 states. [2019-12-18 12:25:11,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:11,613 INFO L93 Difference]: Finished difference Result 65123 states and 200338 transitions. [2019-12-18 12:25:11,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 12:25:11,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:25:11,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:11,712 INFO L225 Difference]: With dead ends: 65123 [2019-12-18 12:25:11,712 INFO L226 Difference]: Without dead ends: 65123 [2019-12-18 12:25:11,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:25:11,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65123 states. [2019-12-18 12:25:12,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65123 to 44842. [2019-12-18 12:25:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44842 states. [2019-12-18 12:25:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44842 states to 44842 states and 138685 transitions. [2019-12-18 12:25:12,564 INFO L78 Accepts]: Start accepts. Automaton has 44842 states and 138685 transitions. Word has length 65 [2019-12-18 12:25:12,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:12,565 INFO L462 AbstractCegarLoop]: Abstraction has 44842 states and 138685 transitions. [2019-12-18 12:25:12,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:25:12,565 INFO L276 IsEmpty]: Start isEmpty. Operand 44842 states and 138685 transitions. [2019-12-18 12:25:12,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:12,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:12,613 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:12,613 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:12,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:12,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1646807062, now seen corresponding path program 3 times [2019-12-18 12:25:12,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:12,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450625594] [2019-12-18 12:25:12,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:12,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:12,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450625594] [2019-12-18 12:25:12,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:12,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 12:25:12,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730549843] [2019-12-18 12:25:12,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:25:12,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:12,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:25:12,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:25:12,915 INFO L87 Difference]: Start difference. First operand 44842 states and 138685 transitions. Second operand 12 states. [2019-12-18 12:25:16,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:16,372 INFO L93 Difference]: Finished difference Result 68228 states and 207964 transitions. [2019-12-18 12:25:16,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 12:25:16,373 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-18 12:25:16,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:16,477 INFO L225 Difference]: With dead ends: 68228 [2019-12-18 12:25:16,477 INFO L226 Difference]: Without dead ends: 68228 [2019-12-18 12:25:16,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=254, Invalid=1152, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 12:25:16,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68228 states. [2019-12-18 12:25:17,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68228 to 44286. [2019-12-18 12:25:17,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44286 states. [2019-12-18 12:25:17,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44286 states to 44286 states and 136956 transitions. [2019-12-18 12:25:17,433 INFO L78 Accepts]: Start accepts. Automaton has 44286 states and 136956 transitions. Word has length 65 [2019-12-18 12:25:17,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:17,433 INFO L462 AbstractCegarLoop]: Abstraction has 44286 states and 136956 transitions. [2019-12-18 12:25:17,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:25:17,434 INFO L276 IsEmpty]: Start isEmpty. Operand 44286 states and 136956 transitions. [2019-12-18 12:25:17,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:17,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:17,486 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:17,486 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:17,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:17,486 INFO L82 PathProgramCache]: Analyzing trace with hash 883167852, now seen corresponding path program 6 times [2019-12-18 12:25:17,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:17,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665351372] [2019-12-18 12:25:17,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:17,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665351372] [2019-12-18 12:25:17,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:17,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:25:17,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37984011] [2019-12-18 12:25:17,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:25:17,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:17,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:25:17,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:25:17,568 INFO L87 Difference]: Start difference. First operand 44286 states and 136956 transitions. Second operand 4 states. [2019-12-18 12:25:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:17,882 INFO L93 Difference]: Finished difference Result 44286 states and 136684 transitions. [2019-12-18 12:25:17,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:25:17,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 12:25:17,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:17,984 INFO L225 Difference]: With dead ends: 44286 [2019-12-18 12:25:17,984 INFO L226 Difference]: Without dead ends: 44286 [2019-12-18 12:25:17,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:25:18,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44286 states. [2019-12-18 12:25:18,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44286 to 42326. [2019-12-18 12:25:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42326 states. [2019-12-18 12:25:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42326 states to 42326 states and 131029 transitions. [2019-12-18 12:25:18,789 INFO L78 Accepts]: Start accepts. Automaton has 42326 states and 131029 transitions. Word has length 65 [2019-12-18 12:25:18,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:18,790 INFO L462 AbstractCegarLoop]: Abstraction has 42326 states and 131029 transitions. [2019-12-18 12:25:18,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:25:18,790 INFO L276 IsEmpty]: Start isEmpty. Operand 42326 states and 131029 transitions. [2019-12-18 12:25:18,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:18,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:18,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:18,836 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:18,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:18,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1521961444, now seen corresponding path program 4 times [2019-12-18 12:25:18,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:18,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253097634] [2019-12-18 12:25:18,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:18,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253097634] [2019-12-18 12:25:18,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:18,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:25:18,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890912060] [2019-12-18 12:25:18,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:25:18,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:18,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:25:18,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:25:18,898 INFO L87 Difference]: Start difference. First operand 42326 states and 131029 transitions. Second operand 3 states. [2019-12-18 12:25:19,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:19,041 INFO L93 Difference]: Finished difference Result 32952 states and 100921 transitions. [2019-12-18 12:25:19,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:25:19,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:25:19,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:19,088 INFO L225 Difference]: With dead ends: 32952 [2019-12-18 12:25:19,088 INFO L226 Difference]: Without dead ends: 32952 [2019-12-18 12:25:19,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:25:19,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32952 states. [2019-12-18 12:25:19,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32952 to 31460. [2019-12-18 12:25:19,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31460 states. [2019-12-18 12:25:19,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31460 states to 31460 states and 95951 transitions. [2019-12-18 12:25:19,935 INFO L78 Accepts]: Start accepts. Automaton has 31460 states and 95951 transitions. Word has length 65 [2019-12-18 12:25:19,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:19,935 INFO L462 AbstractCegarLoop]: Abstraction has 31460 states and 95951 transitions. [2019-12-18 12:25:19,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:25:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 31460 states and 95951 transitions. [2019-12-18 12:25:19,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:25:19,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:19,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:19,970 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:19,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:19,970 INFO L82 PathProgramCache]: Analyzing trace with hash -576070305, now seen corresponding path program 1 times [2019-12-18 12:25:19,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:19,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202600757] [2019-12-18 12:25:19,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:20,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:20,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202600757] [2019-12-18 12:25:20,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:20,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:25:20,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900342112] [2019-12-18 12:25:20,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:25:20,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:20,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:25:20,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:25:20,080 INFO L87 Difference]: Start difference. First operand 31460 states and 95951 transitions. Second operand 9 states. [2019-12-18 12:25:21,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:21,606 INFO L93 Difference]: Finished difference Result 61318 states and 185750 transitions. [2019-12-18 12:25:21,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:25:21,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 12:25:21,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:21,681 INFO L225 Difference]: With dead ends: 61318 [2019-12-18 12:25:21,682 INFO L226 Difference]: Without dead ends: 49997 [2019-12-18 12:25:21,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:25:21,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49997 states. [2019-12-18 12:25:22,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49997 to 32234. [2019-12-18 12:25:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32234 states. [2019-12-18 12:25:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32234 states to 32234 states and 97856 transitions. [2019-12-18 12:25:22,331 INFO L78 Accepts]: Start accepts. Automaton has 32234 states and 97856 transitions. Word has length 66 [2019-12-18 12:25:22,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:22,331 INFO L462 AbstractCegarLoop]: Abstraction has 32234 states and 97856 transitions. [2019-12-18 12:25:22,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:25:22,332 INFO L276 IsEmpty]: Start isEmpty. Operand 32234 states and 97856 transitions. [2019-12-18 12:25:22,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:25:22,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:22,367 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:22,367 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:22,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:22,367 INFO L82 PathProgramCache]: Analyzing trace with hash -454529783, now seen corresponding path program 2 times [2019-12-18 12:25:22,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:22,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808830232] [2019-12-18 12:25:22,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:22,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:22,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808830232] [2019-12-18 12:25:22,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:22,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:25:22,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706683249] [2019-12-18 12:25:22,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:25:22,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:22,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:25:22,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:25:22,476 INFO L87 Difference]: Start difference. First operand 32234 states and 97856 transitions. Second operand 8 states. [2019-12-18 12:25:24,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:24,268 INFO L93 Difference]: Finished difference Result 51031 states and 151457 transitions. [2019-12-18 12:25:24,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:25:24,268 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 12:25:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:24,340 INFO L225 Difference]: With dead ends: 51031 [2019-12-18 12:25:24,340 INFO L226 Difference]: Without dead ends: 50623 [2019-12-18 12:25:24,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:25:24,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50623 states. [2019-12-18 12:25:25,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50623 to 35692. [2019-12-18 12:25:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35692 states. [2019-12-18 12:25:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35692 states to 35692 states and 107911 transitions. [2019-12-18 12:25:25,349 INFO L78 Accepts]: Start accepts. Automaton has 35692 states and 107911 transitions. Word has length 66 [2019-12-18 12:25:25,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:25,349 INFO L462 AbstractCegarLoop]: Abstraction has 35692 states and 107911 transitions. [2019-12-18 12:25:25,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:25:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 35692 states and 107911 transitions. [2019-12-18 12:25:25,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:25:25,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:25,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:25,385 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:25,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:25,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1507528227, now seen corresponding path program 3 times [2019-12-18 12:25:25,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:25,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649814627] [2019-12-18 12:25:25,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:25,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649814627] [2019-12-18 12:25:25,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:25,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 12:25:25,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946155764] [2019-12-18 12:25:25,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 12:25:25,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:25,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 12:25:25,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-12-18 12:25:25,872 INFO L87 Difference]: Start difference. First operand 35692 states and 107911 transitions. Second operand 16 states. [2019-12-18 12:25:29,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:29,625 INFO L93 Difference]: Finished difference Result 64402 states and 190569 transitions. [2019-12-18 12:25:29,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-18 12:25:29,625 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-18 12:25:29,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:29,708 INFO L225 Difference]: With dead ends: 64402 [2019-12-18 12:25:29,708 INFO L226 Difference]: Without dead ends: 57589 [2019-12-18 12:25:29,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=313, Invalid=1493, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 12:25:29,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57589 states. [2019-12-18 12:25:30,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57589 to 36757. [2019-12-18 12:25:30,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36757 states. [2019-12-18 12:25:30,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36757 states to 36757 states and 110809 transitions. [2019-12-18 12:25:30,444 INFO L78 Accepts]: Start accepts. Automaton has 36757 states and 110809 transitions. Word has length 66 [2019-12-18 12:25:30,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:30,444 INFO L462 AbstractCegarLoop]: Abstraction has 36757 states and 110809 transitions. [2019-12-18 12:25:30,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 12:25:30,445 INFO L276 IsEmpty]: Start isEmpty. Operand 36757 states and 110809 transitions. [2019-12-18 12:25:30,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:25:30,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:30,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:30,482 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:30,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:30,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1773049433, now seen corresponding path program 4 times [2019-12-18 12:25:30,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:30,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313540124] [2019-12-18 12:25:30,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:30,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313540124] [2019-12-18 12:25:30,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:30,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:25:30,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472121016] [2019-12-18 12:25:30,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:25:30,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:30,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:25:30,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:25:30,634 INFO L87 Difference]: Start difference. First operand 36757 states and 110809 transitions. Second operand 10 states. [2019-12-18 12:25:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:33,647 INFO L93 Difference]: Finished difference Result 56354 states and 166429 transitions. [2019-12-18 12:25:33,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 12:25:33,648 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 12:25:33,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:33,728 INFO L225 Difference]: With dead ends: 56354 [2019-12-18 12:25:33,728 INFO L226 Difference]: Without dead ends: 56354 [2019-12-18 12:25:33,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=876, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 12:25:33,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56354 states. [2019-12-18 12:25:34,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56354 to 39612. [2019-12-18 12:25:34,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39612 states. [2019-12-18 12:25:34,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39612 states to 39612 states and 118839 transitions. [2019-12-18 12:25:34,459 INFO L78 Accepts]: Start accepts. Automaton has 39612 states and 118839 transitions. Word has length 66 [2019-12-18 12:25:34,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:34,459 INFO L462 AbstractCegarLoop]: Abstraction has 39612 states and 118839 transitions. [2019-12-18 12:25:34,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:25:34,459 INFO L276 IsEmpty]: Start isEmpty. Operand 39612 states and 118839 transitions. [2019-12-18 12:25:34,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:25:34,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:34,499 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:34,499 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:34,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:34,500 INFO L82 PathProgramCache]: Analyzing trace with hash 189008577, now seen corresponding path program 5 times [2019-12-18 12:25:34,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:34,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897713333] [2019-12-18 12:25:34,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:34,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:34,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897713333] [2019-12-18 12:25:34,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:34,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 12:25:34,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885840872] [2019-12-18 12:25:34,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:25:34,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:34,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:25:34,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:25:34,676 INFO L87 Difference]: Start difference. First operand 39612 states and 118839 transitions. Second operand 11 states. [2019-12-18 12:25:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:38,491 INFO L93 Difference]: Finished difference Result 57791 states and 170391 transitions. [2019-12-18 12:25:38,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 12:25:38,492 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:25:38,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:38,573 INFO L225 Difference]: With dead ends: 57791 [2019-12-18 12:25:38,573 INFO L226 Difference]: Without dead ends: 57791 [2019-12-18 12:25:38,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=350, Invalid=2100, Unknown=0, NotChecked=0, Total=2450 [2019-12-18 12:25:38,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57791 states. [2019-12-18 12:25:39,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57791 to 39866. [2019-12-18 12:25:39,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39866 states. [2019-12-18 12:25:39,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39866 states to 39866 states and 119684 transitions. [2019-12-18 12:25:39,554 INFO L78 Accepts]: Start accepts. Automaton has 39866 states and 119684 transitions. Word has length 66 [2019-12-18 12:25:39,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:39,554 INFO L462 AbstractCegarLoop]: Abstraction has 39866 states and 119684 transitions. [2019-12-18 12:25:39,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:25:39,554 INFO L276 IsEmpty]: Start isEmpty. Operand 39866 states and 119684 transitions. [2019-12-18 12:25:39,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:25:39,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:39,595 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:39,595 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:39,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:39,595 INFO L82 PathProgramCache]: Analyzing trace with hash -247266297, now seen corresponding path program 6 times [2019-12-18 12:25:39,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:39,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910829957] [2019-12-18 12:25:39,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:39,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:39,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910829957] [2019-12-18 12:25:39,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:39,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 12:25:39,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777542313] [2019-12-18 12:25:39,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:25:39,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:39,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:25:39,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:25:39,795 INFO L87 Difference]: Start difference. First operand 39866 states and 119684 transitions. Second operand 12 states. [2019-12-18 12:25:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:44,587 INFO L93 Difference]: Finished difference Result 58815 states and 172725 transitions. [2019-12-18 12:25:44,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-18 12:25:44,588 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 12:25:44,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:44,675 INFO L225 Difference]: With dead ends: 58815 [2019-12-18 12:25:44,675 INFO L226 Difference]: Without dead ends: 58815 [2019-12-18 12:25:44,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=518, Invalid=3642, Unknown=0, NotChecked=0, Total=4160 [2019-12-18 12:25:44,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58815 states. [2019-12-18 12:25:45,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58815 to 36534. [2019-12-18 12:25:45,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36534 states. [2019-12-18 12:25:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36534 states to 36534 states and 110468 transitions. [2019-12-18 12:25:45,437 INFO L78 Accepts]: Start accepts. Automaton has 36534 states and 110468 transitions. Word has length 66 [2019-12-18 12:25:45,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:45,438 INFO L462 AbstractCegarLoop]: Abstraction has 36534 states and 110468 transitions. [2019-12-18 12:25:45,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:25:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 36534 states and 110468 transitions. [2019-12-18 12:25:45,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:25:45,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:45,476 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:45,476 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:45,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:45,477 INFO L82 PathProgramCache]: Analyzing trace with hash -134578799, now seen corresponding path program 7 times [2019-12-18 12:25:45,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:45,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252676590] [2019-12-18 12:25:45,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:45,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252676590] [2019-12-18 12:25:45,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:45,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:25:45,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15565262] [2019-12-18 12:25:45,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:25:45,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:45,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:25:45,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:25:45,644 INFO L87 Difference]: Start difference. First operand 36534 states and 110468 transitions. Second operand 11 states. [2019-12-18 12:25:47,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:47,881 INFO L93 Difference]: Finished difference Result 49566 states and 150207 transitions. [2019-12-18 12:25:47,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:25:47,881 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:25:47,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:47,946 INFO L225 Difference]: With dead ends: 49566 [2019-12-18 12:25:47,947 INFO L226 Difference]: Without dead ends: 46397 [2019-12-18 12:25:47,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:25:48,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46397 states. [2019-12-18 12:25:48,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46397 to 38043. [2019-12-18 12:25:48,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38043 states. [2019-12-18 12:25:48,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38043 states to 38043 states and 114813 transitions. [2019-12-18 12:25:48,558 INFO L78 Accepts]: Start accepts. Automaton has 38043 states and 114813 transitions. Word has length 66 [2019-12-18 12:25:48,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:48,559 INFO L462 AbstractCegarLoop]: Abstraction has 38043 states and 114813 transitions. [2019-12-18 12:25:48,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:25:48,559 INFO L276 IsEmpty]: Start isEmpty. Operand 38043 states and 114813 transitions. [2019-12-18 12:25:48,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:25:48,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:48,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:48,596 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:48,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:48,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1540975619, now seen corresponding path program 8 times [2019-12-18 12:25:48,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:48,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429580196] [2019-12-18 12:25:48,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:48,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429580196] [2019-12-18 12:25:48,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:48,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:25:48,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543896763] [2019-12-18 12:25:48,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:25:48,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:48,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:25:48,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:25:48,732 INFO L87 Difference]: Start difference. First operand 38043 states and 114813 transitions. Second operand 11 states. [2019-12-18 12:25:50,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:50,442 INFO L93 Difference]: Finished difference Result 53693 states and 161317 transitions. [2019-12-18 12:25:50,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:25:50,442 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:25:50,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:50,511 INFO L225 Difference]: With dead ends: 53693 [2019-12-18 12:25:50,512 INFO L226 Difference]: Without dead ends: 49485 [2019-12-18 12:25:50,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:25:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49485 states. [2019-12-18 12:25:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49485 to 36998. [2019-12-18 12:25:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36998 states. [2019-12-18 12:25:51,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36998 states to 36998 states and 111596 transitions. [2019-12-18 12:25:51,153 INFO L78 Accepts]: Start accepts. Automaton has 36998 states and 111596 transitions. Word has length 66 [2019-12-18 12:25:51,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:51,153 INFO L462 AbstractCegarLoop]: Abstraction has 36998 states and 111596 transitions. [2019-12-18 12:25:51,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:25:51,153 INFO L276 IsEmpty]: Start isEmpty. Operand 36998 states and 111596 transitions. [2019-12-18 12:25:51,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:25:51,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:51,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:51,190 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:51,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:51,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1140853909, now seen corresponding path program 9 times [2019-12-18 12:25:51,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:51,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706706929] [2019-12-18 12:25:51,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:51,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:51,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706706929] [2019-12-18 12:25:51,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:51,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 12:25:51,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609341445] [2019-12-18 12:25:51,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 12:25:51,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:51,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 12:25:51,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:25:51,624 INFO L87 Difference]: Start difference. First operand 36998 states and 111596 transitions. Second operand 15 states. [2019-12-18 12:25:55,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:55,173 INFO L93 Difference]: Finished difference Result 42872 states and 128489 transitions. [2019-12-18 12:25:55,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 12:25:55,173 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-18 12:25:55,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:55,232 INFO L225 Difference]: With dead ends: 42872 [2019-12-18 12:25:55,232 INFO L226 Difference]: Without dead ends: 40619 [2019-12-18 12:25:55,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=354, Invalid=1626, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 12:25:55,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40619 states. [2019-12-18 12:25:55,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40619 to 37903. [2019-12-18 12:25:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37903 states. [2019-12-18 12:25:55,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37903 states to 37903 states and 114211 transitions. [2019-12-18 12:25:55,817 INFO L78 Accepts]: Start accepts. Automaton has 37903 states and 114211 transitions. Word has length 66 [2019-12-18 12:25:55,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:55,817 INFO L462 AbstractCegarLoop]: Abstraction has 37903 states and 114211 transitions. [2019-12-18 12:25:55,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 12:25:55,818 INFO L276 IsEmpty]: Start isEmpty. Operand 37903 states and 114211 transitions. [2019-12-18 12:25:55,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:25:55,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:55,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:55,855 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:55,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:55,856 INFO L82 PathProgramCache]: Analyzing trace with hash -802732177, now seen corresponding path program 10 times [2019-12-18 12:25:55,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:55,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920779684] [2019-12-18 12:25:55,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:56,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:56,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920779684] [2019-12-18 12:25:56,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:56,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 12:25:56,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114215136] [2019-12-18 12:25:56,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 12:25:56,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:56,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 12:25:56,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:25:56,313 INFO L87 Difference]: Start difference. First operand 37903 states and 114211 transitions. Second operand 15 states. [2019-12-18 12:25:59,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:59,799 INFO L93 Difference]: Finished difference Result 48959 states and 146176 transitions. [2019-12-18 12:25:59,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 12:25:59,800 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-18 12:25:59,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:59,863 INFO L225 Difference]: With dead ends: 48959 [2019-12-18 12:25:59,864 INFO L226 Difference]: Without dead ends: 47032 [2019-12-18 12:25:59,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=303, Invalid=1337, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 12:26:00,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47032 states. [2019-12-18 12:26:00,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47032 to 39129. [2019-12-18 12:26:00,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39129 states. [2019-12-18 12:26:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39129 states to 39129 states and 117931 transitions. [2019-12-18 12:26:00,711 INFO L78 Accepts]: Start accepts. Automaton has 39129 states and 117931 transitions. Word has length 66 [2019-12-18 12:26:00,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:00,712 INFO L462 AbstractCegarLoop]: Abstraction has 39129 states and 117931 transitions. [2019-12-18 12:26:00,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 12:26:00,712 INFO L276 IsEmpty]: Start isEmpty. Operand 39129 states and 117931 transitions. [2019-12-18 12:26:00,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:26:00,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:00,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:00,750 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:00,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:00,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1005318181, now seen corresponding path program 11 times [2019-12-18 12:26:00,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:00,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004780279] [2019-12-18 12:26:00,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:01,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:01,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004780279] [2019-12-18 12:26:01,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:01,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 12:26:01,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146729030] [2019-12-18 12:26:01,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 12:26:01,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:01,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 12:26:01,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:26:01,157 INFO L87 Difference]: Start difference. First operand 39129 states and 117931 transitions. Second operand 15 states. [2019-12-18 12:26:05,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:05,066 INFO L93 Difference]: Finished difference Result 47801 states and 142110 transitions. [2019-12-18 12:26:05,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 12:26:05,067 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-18 12:26:05,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:05,128 INFO L225 Difference]: With dead ends: 47801 [2019-12-18 12:26:05,128 INFO L226 Difference]: Without dead ends: 45812 [2019-12-18 12:26:05,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=280, Invalid=1202, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 12:26:05,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45812 states. [2019-12-18 12:26:05,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45812 to 37620. [2019-12-18 12:26:05,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37620 states. [2019-12-18 12:26:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37620 states to 37620 states and 113308 transitions. [2019-12-18 12:26:05,752 INFO L78 Accepts]: Start accepts. Automaton has 37620 states and 113308 transitions. Word has length 66 [2019-12-18 12:26:05,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:05,752 INFO L462 AbstractCegarLoop]: Abstraction has 37620 states and 113308 transitions. [2019-12-18 12:26:05,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 12:26:05,752 INFO L276 IsEmpty]: Start isEmpty. Operand 37620 states and 113308 transitions. [2019-12-18 12:26:05,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:26:05,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:05,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:05,789 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:05,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:05,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1701519629, now seen corresponding path program 12 times [2019-12-18 12:26:05,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:05,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788175732] [2019-12-18 12:26:05,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:05,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788175732] [2019-12-18 12:26:05,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:05,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:26:05,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367399696] [2019-12-18 12:26:05,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:26:05,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:05,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:26:05,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:26:05,943 INFO L87 Difference]: Start difference. First operand 37620 states and 113308 transitions. Second operand 11 states. [2019-12-18 12:26:07,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:07,122 INFO L93 Difference]: Finished difference Result 71753 states and 214819 transitions. [2019-12-18 12:26:07,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 12:26:07,122 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:26:07,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:07,218 INFO L225 Difference]: With dead ends: 71753 [2019-12-18 12:26:07,218 INFO L226 Difference]: Without dead ends: 67339 [2019-12-18 12:26:07,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 12:26:07,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67339 states. [2019-12-18 12:26:08,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67339 to 41195. [2019-12-18 12:26:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41195 states. [2019-12-18 12:26:08,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41195 states to 41195 states and 123776 transitions. [2019-12-18 12:26:08,326 INFO L78 Accepts]: Start accepts. Automaton has 41195 states and 123776 transitions. Word has length 66 [2019-12-18 12:26:08,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:08,326 INFO L462 AbstractCegarLoop]: Abstraction has 41195 states and 123776 transitions. [2019-12-18 12:26:08,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:26:08,326 INFO L276 IsEmpty]: Start isEmpty. Operand 41195 states and 123776 transitions. [2019-12-18 12:26:08,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:26:08,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:08,372 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:08,372 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:08,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:08,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1837055357, now seen corresponding path program 13 times [2019-12-18 12:26:08,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:08,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436724592] [2019-12-18 12:26:08,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:08,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:08,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436724592] [2019-12-18 12:26:08,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:08,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:26:08,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694175616] [2019-12-18 12:26:08,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:26:08,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:08,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:26:08,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:26:08,536 INFO L87 Difference]: Start difference. First operand 41195 states and 123776 transitions. Second operand 11 states. [2019-12-18 12:26:09,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:09,552 INFO L93 Difference]: Finished difference Result 67967 states and 202702 transitions. [2019-12-18 12:26:09,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:26:09,552 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:26:09,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:09,630 INFO L225 Difference]: With dead ends: 67967 [2019-12-18 12:26:09,630 INFO L226 Difference]: Without dead ends: 57119 [2019-12-18 12:26:09,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:26:09,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57119 states. [2019-12-18 12:26:10,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57119 to 34196. [2019-12-18 12:26:10,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34196 states. [2019-12-18 12:26:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34196 states to 34196 states and 103423 transitions. [2019-12-18 12:26:10,296 INFO L78 Accepts]: Start accepts. Automaton has 34196 states and 103423 transitions. Word has length 66 [2019-12-18 12:26:10,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:10,297 INFO L462 AbstractCegarLoop]: Abstraction has 34196 states and 103423 transitions. [2019-12-18 12:26:10,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:26:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 34196 states and 103423 transitions. [2019-12-18 12:26:10,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:26:10,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:10,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:10,331 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:10,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:10,331 INFO L82 PathProgramCache]: Analyzing trace with hash -2147462405, now seen corresponding path program 14 times [2019-12-18 12:26:10,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:10,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062112043] [2019-12-18 12:26:10,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:10,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:10,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062112043] [2019-12-18 12:26:10,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:10,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:26:10,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866205956] [2019-12-18 12:26:10,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:26:10,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:10,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:26:10,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:10,385 INFO L87 Difference]: Start difference. First operand 34196 states and 103423 transitions. Second operand 3 states. [2019-12-18 12:26:10,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:10,542 INFO L93 Difference]: Finished difference Result 34195 states and 103421 transitions. [2019-12-18 12:26:10,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:26:10,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:26:10,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:10,609 INFO L225 Difference]: With dead ends: 34195 [2019-12-18 12:26:10,609 INFO L226 Difference]: Without dead ends: 34195 [2019-12-18 12:26:10,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:10,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34195 states. [2019-12-18 12:26:11,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34195 to 22726. [2019-12-18 12:26:11,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22726 states. [2019-12-18 12:26:11,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22726 states to 22726 states and 70416 transitions. [2019-12-18 12:26:11,444 INFO L78 Accepts]: Start accepts. Automaton has 22726 states and 70416 transitions. Word has length 66 [2019-12-18 12:26:11,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:11,445 INFO L462 AbstractCegarLoop]: Abstraction has 22726 states and 70416 transitions. [2019-12-18 12:26:11,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:26:11,445 INFO L276 IsEmpty]: Start isEmpty. Operand 22726 states and 70416 transitions. [2019-12-18 12:26:11,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:26:11,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:11,467 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:11,467 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:11,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:11,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1853423759, now seen corresponding path program 1 times [2019-12-18 12:26:11,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:11,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332019985] [2019-12-18 12:26:11,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:11,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332019985] [2019-12-18 12:26:11,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:11,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:26:11,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005846032] [2019-12-18 12:26:11,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:26:11,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:11,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:26:11,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:26:11,637 INFO L87 Difference]: Start difference. First operand 22726 states and 70416 transitions. Second operand 12 states. [2019-12-18 12:26:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:13,919 INFO L93 Difference]: Finished difference Result 31708 states and 96578 transitions. [2019-12-18 12:26:13,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:26:13,920 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 12:26:13,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:13,964 INFO L225 Difference]: With dead ends: 31708 [2019-12-18 12:26:13,964 INFO L226 Difference]: Without dead ends: 31281 [2019-12-18 12:26:13,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:26:14,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31281 states. [2019-12-18 12:26:14,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31281 to 22466. [2019-12-18 12:26:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22466 states. [2019-12-18 12:26:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22466 states to 22466 states and 69750 transitions. [2019-12-18 12:26:14,367 INFO L78 Accepts]: Start accepts. Automaton has 22466 states and 69750 transitions. Word has length 67 [2019-12-18 12:26:14,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:14,367 INFO L462 AbstractCegarLoop]: Abstraction has 22466 states and 69750 transitions. [2019-12-18 12:26:14,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:26:14,367 INFO L276 IsEmpty]: Start isEmpty. Operand 22466 states and 69750 transitions. [2019-12-18 12:26:14,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:26:14,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:14,388 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:14,388 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:14,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:14,388 INFO L82 PathProgramCache]: Analyzing trace with hash 594227727, now seen corresponding path program 2 times [2019-12-18 12:26:14,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:14,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731389100] [2019-12-18 12:26:14,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:26:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:26:14,503 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:26:14,504 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:26:14,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~x~0_45 0) (= 0 v_~a$w_buff0_used~0_768) (= v_~y~0_18 0) (= 0 v_~a$r_buff1_thd1~0_150) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t257~0.base_33|) (= 0 v_~__unbuffered_p2_EAX~0_31) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$w_buff1_used~0_426) (= v_~main$tmp_guard0~0_29 0) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~a$w_buff1~0_200) (= v_~a$r_buff1_thd3~0_269 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~__unbuffered_p0_EAX~0_111) (= v_~a$r_buff0_thd3~0_320 0) (= v_~a~0_184 0) (= 0 |v_ULTIMATE.start_main_~#t257~0.offset_23|) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~__unbuffered_cnt~0_102 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t257~0.base_33| 4) |v_#length_21|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t257~0.base_33|)) (= 0 |v_#NULL.base_4|) (= v_~a$flush_delayed~0_25 0) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$r_buff0_thd0~0_107 0) (= v_~main$tmp_guard1~0_32 0) (= v_~a$r_buff1_thd0~0_160 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t257~0.base_33| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t257~0.base_33|) |v_ULTIMATE.start_main_~#t257~0.offset_23| 0)) |v_#memory_int_19|) (= v_~a$w_buff0~0_274 0) (= v_~z~0_21 0) (= |v_#NULL.offset_4| 0) (= v_~a$mem_tmp~0_14 0) (= 0 v_~a$r_buff0_thd1~0_184) (= 0 v_~a$r_buff1_thd2~0_145) (= v_~a$r_buff0_thd2~0_95 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t257~0.base_33| 1) |v_#valid_63|) (= v_~weak$$choice2~0_110 0) (= v_~__unbuffered_p2_EBX~0_40 0) (= 0 v_~a$read_delayed~0_8) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t258~0.offset=|v_ULTIMATE.start_main_~#t258~0.offset_19|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_145, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_67|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_471|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_107, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ~a~0=v_~a~0_184, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_111, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_40, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_269, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_768, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_184, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_274, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_160, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_45, ULTIMATE.start_main_~#t259~0.base=|v_ULTIMATE.start_main_~#t259~0.base_25|, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_95, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ULTIMATE.start_main_~#t257~0.offset=|v_ULTIMATE.start_main_~#t257~0.offset_23|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_29|, ~a$w_buff1~0=v_~a$w_buff1~0_200, ~y~0=v_~y~0_18, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_150, ULTIMATE.start_main_~#t257~0.base=|v_ULTIMATE.start_main_~#t257~0.base_33|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_320, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t258~0.base=|v_ULTIMATE.start_main_~#t258~0.base_25|, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ULTIMATE.start_main_~#t259~0.offset=|v_ULTIMATE.start_main_~#t259~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_21, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_426, ~weak$$choice2~0=v_~weak$$choice2~0_110, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t258~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t259~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t257~0.offset, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t257~0.base, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t258~0.base, ~a$flush_delayed~0, ULTIMATE.start_main_~#t259~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 12:26:14,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_20 |v_P0Thread1of1ForFork1_#in~arg.offset_20|) (= 1 v_~a$w_buff0_used~0_240) (= (mod v_~a$w_buff1_used~0_130 256) 0) (= v_~a$w_buff0_used~0_241 v_~a$w_buff1_used~0_130) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_24 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|) (= |v_P0Thread1of1ForFork1_#in~arg.base_20| v_P0Thread1of1ForFork1_~arg.base_20) (= 1 v_~a$w_buff0~0_55) (= v_~a$w_buff0~0_56 v_~a$w_buff1~0_50) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_241, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_50, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_55, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_240, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_20} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 12:26:14,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L837-1-->L839: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t258~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t258~0.base_12|) |v_ULTIMATE.start_main_~#t258~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t258~0.base_12|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t258~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t258~0.base_12|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t258~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t258~0.offset_10| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t258~0.base_12| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t258~0.base=|v_ULTIMATE.start_main_~#t258~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t258~0.offset=|v_ULTIMATE.start_main_~#t258~0.offset_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t258~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t258~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 12:26:14,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L839-1-->L841: Formula: (and (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t259~0.base_12|) 0) (= |v_ULTIMATE.start_main_~#t259~0.offset_10| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t259~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t259~0.base_12|) |v_ULTIMATE.start_main_~#t259~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t259~0.base_12|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t259~0.base_12| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t259~0.base_12|)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t259~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t259~0.base=|v_ULTIMATE.start_main_~#t259~0.base_12|, ULTIMATE.start_main_~#t259~0.offset=|v_ULTIMATE.start_main_~#t259~0.offset_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t259~0.base, ULTIMATE.start_main_~#t259~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-18 12:26:14,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L778-2-->L778-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In604499009 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In604499009 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out604499009| ~a~0_In604499009)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out604499009| ~a$w_buff1~0_In604499009) (not .cse1) (not .cse0)))) InVars {~a~0=~a~0_In604499009, ~a$w_buff1~0=~a$w_buff1~0_In604499009, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In604499009, ~a$w_buff1_used~0=~a$w_buff1_used~0_In604499009} OutVars{~a~0=~a~0_In604499009, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out604499009|, ~a$w_buff1~0=~a$w_buff1~0_In604499009, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In604499009, ~a$w_buff1_used~0=~a$w_buff1_used~0_In604499009} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 12:26:14,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L778-4-->L779: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_16| v_~a~0_33) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_16|} OutVars{~a~0=v_~a~0_33, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_15|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_23|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:26:14,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-620713438 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-620713438 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-620713438| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-620713438| ~a$w_buff0_used~0_In-620713438)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-620713438, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-620713438} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-620713438, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-620713438, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-620713438|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:26:14,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1359302176 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1359302176 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out1359302176| 0)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1359302176 |P0Thread1of1ForFork1_#t~ite5_Out1359302176|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1359302176, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1359302176} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1359302176|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1359302176, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1359302176} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:26:14,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L754-->L754-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd1~0_In1610967331 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1610967331 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In1610967331 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In1610967331 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out1610967331| 0)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out1610967331| ~a$w_buff1_used~0_In1610967331) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1610967331, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1610967331, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1610967331, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1610967331} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1610967331|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1610967331, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1610967331, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1610967331, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1610967331} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:26:14,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L755-->L756: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In719154599 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In719154599 256)))) (or (and (= ~a$r_buff0_thd1~0_Out719154599 ~a$r_buff0_thd1~0_In719154599) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out719154599) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In719154599, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In719154599} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out719154599|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In719154599, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out719154599} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:26:14,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-555896694 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-555896694 256))) (.cse2 (= (mod ~a$r_buff1_thd1~0_In-555896694 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-555896694 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-555896694| ~a$r_buff1_thd1~0_In-555896694) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out-555896694| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-555896694, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-555896694, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-555896694, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-555896694} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-555896694|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-555896694, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-555896694, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-555896694, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-555896694} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:26:14,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L756-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_50|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_50|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_49|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:26:14,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In567984918 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In567984918| |P2Thread1of1ForFork0_#t~ite20_Out567984918|) (= |P2Thread1of1ForFork0_#t~ite21_Out567984918| ~a$w_buff0~0_In567984918) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite21_Out567984918| |P2Thread1of1ForFork0_#t~ite20_Out567984918|) (= |P2Thread1of1ForFork0_#t~ite20_Out567984918| ~a$w_buff0~0_In567984918) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In567984918 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In567984918 256)) (and (= 0 (mod ~a$w_buff1_used~0_In567984918 256)) .cse1) (and (= (mod ~a$r_buff1_thd3~0_In567984918 256) 0) .cse1)))))) InVars {~a$w_buff0~0=~a$w_buff0~0_In567984918, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In567984918, ~a$w_buff0_used~0=~a$w_buff0_used~0_In567984918, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In567984918, ~a$w_buff1_used~0=~a$w_buff1_used~0_In567984918, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In567984918|, ~weak$$choice2~0=~weak$$choice2~0_In567984918} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out567984918|, ~a$w_buff0~0=~a$w_buff0~0_In567984918, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In567984918, ~a$w_buff0_used~0=~a$w_buff0_used~0_In567984918, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In567984918, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out567984918|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In567984918, ~weak$$choice2~0=~weak$$choice2~0_In567984918} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 12:26:14,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L805-->L805-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2143999932 256) 0))) (or (and (= ~a$w_buff0_used~0_In-2143999932 |P2Thread1of1ForFork0_#t~ite26_Out-2143999932|) (= |P2Thread1of1ForFork0_#t~ite27_Out-2143999932| |P2Thread1of1ForFork0_#t~ite26_Out-2143999932|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-2143999932 256)))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-2143999932 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In-2143999932 256)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-2143999932 256)))))) (and (= |P2Thread1of1ForFork0_#t~ite26_In-2143999932| |P2Thread1of1ForFork0_#t~ite26_Out-2143999932|) (not .cse0) (= ~a$w_buff0_used~0_In-2143999932 |P2Thread1of1ForFork0_#t~ite27_Out-2143999932|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-2143999932|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2143999932, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2143999932, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2143999932, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2143999932, ~weak$$choice2~0=~weak$$choice2~0_In-2143999932} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-2143999932|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-2143999932|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2143999932, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2143999932, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2143999932, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2143999932, ~weak$$choice2~0=~weak$$choice2~0_In-2143999932} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 12:26:14,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_61 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 12:26:14,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_20 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_20, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 12:26:14,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L814-2-->L814-5: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1141929748 256))) (.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out-1141929748| |P2Thread1of1ForFork0_#t~ite38_Out-1141929748|)) (.cse2 (= (mod ~a$w_buff1_used~0_In-1141929748 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1141929748| ~a~0_In-1141929748) .cse0 (or .cse1 .cse2)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1141929748| ~a$w_buff1~0_In-1141929748) (not .cse1) .cse0 (not .cse2)))) InVars {~a~0=~a~0_In-1141929748, ~a$w_buff1~0=~a$w_buff1~0_In-1141929748, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1141929748, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1141929748} OutVars{~a~0=~a~0_In-1141929748, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-1141929748|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1141929748|, ~a$w_buff1~0=~a$w_buff1~0_In-1141929748, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1141929748, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1141929748} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:26:14,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1197637513 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd3~0_In1197637513 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1197637513|) (not .cse0) (not .cse1)) (and (= ~a$w_buff0_used~0_In1197637513 |P2Thread1of1ForFork0_#t~ite40_Out1197637513|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1197637513, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1197637513} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1197637513|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1197637513, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1197637513} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:26:14,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1669464802 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1669464802 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1669464802 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In1669464802 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out1669464802| ~a$w_buff1_used~0_In1669464802) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out1669464802| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1669464802, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1669464802, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1669464802, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1669464802} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1669464802, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1669464802, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1669464802, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1669464802, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1669464802|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:26:14,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L780-->L780-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In1198470935 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1198470935 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In1198470935 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd2~0_In1198470935 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1198470935|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~a$w_buff1_used~0_In1198470935 |P1Thread1of1ForFork2_#t~ite12_Out1198470935|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1198470935, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1198470935, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1198470935, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1198470935} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1198470935, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1198470935, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1198470935, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1198470935|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1198470935} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:26:14,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In264111772 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In264111772 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out264111772| ~a$r_buff0_thd2~0_In264111772) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out264111772| 0) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In264111772, ~a$w_buff0_used~0=~a$w_buff0_used~0_In264111772} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In264111772, ~a$w_buff0_used~0=~a$w_buff0_used~0_In264111772, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out264111772|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:26:14,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1300335975 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1300335975 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-1300335975 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1300335975 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd2~0_In-1300335975 |P1Thread1of1ForFork2_#t~ite14_Out-1300335975|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1300335975|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1300335975, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1300335975, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1300335975, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1300335975} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1300335975, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1300335975, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1300335975, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1300335975, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1300335975|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:26:14,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L782-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_36| v_~a$r_buff1_thd2~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_36|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_35|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:26:14,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1124183190 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1124183190 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd3~0_In1124183190 |P2Thread1of1ForFork0_#t~ite42_Out1124183190|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1124183190|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1124183190, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1124183190} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1124183190, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1124183190, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1124183190|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:26:14,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In-2146197242 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-2146197242 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-2146197242 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In-2146197242 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In-2146197242 |P2Thread1of1ForFork0_#t~ite43_Out-2146197242|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out-2146197242| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2146197242, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2146197242, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2146197242, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2146197242} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-2146197242|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2146197242, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2146197242, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2146197242, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2146197242} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:26:14,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_149 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_149, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:26:14,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L841-1-->L847: Formula: (and (= 3 v_~__unbuffered_cnt~0_40) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:26:14,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L847-2-->L847-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In872800157 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In872800157 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out872800157| ~a$w_buff1~0_In872800157)) (and (or .cse1 .cse0) (= ~a~0_In872800157 |ULTIMATE.start_main_#t~ite47_Out872800157|)))) InVars {~a~0=~a~0_In872800157, ~a$w_buff1~0=~a$w_buff1~0_In872800157, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In872800157, ~a$w_buff1_used~0=~a$w_buff1_used~0_In872800157} OutVars{~a~0=~a~0_In872800157, ~a$w_buff1~0=~a$w_buff1~0_In872800157, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out872800157|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In872800157, ~a$w_buff1_used~0=~a$w_buff1_used~0_In872800157} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:26:14,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L847-4-->L848: Formula: (= v_~a~0_39 |v_ULTIMATE.start_main_#t~ite47_15|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|} OutVars{~a~0=v_~a~0_39, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 12:26:14,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In188549152 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In188549152 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out188549152| ~a$w_buff0_used~0_In188549152) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out188549152| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In188549152, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In188549152} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In188549152, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out188549152|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In188549152} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:26:14,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-1345139636 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-1345139636 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-1345139636 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-1345139636 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-1345139636| ~a$w_buff1_used~0_In-1345139636) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite50_Out-1345139636| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1345139636, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1345139636, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1345139636, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1345139636} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1345139636|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1345139636, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1345139636, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1345139636, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1345139636} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:26:14,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L850-->L850-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In163208435 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In163208435 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out163208435| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out163208435| ~a$r_buff0_thd0~0_In163208435) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In163208435, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In163208435} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out163208435|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In163208435, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In163208435} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:26:14,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L851-->L851-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In576503817 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In576503817 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In576503817 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In576503817 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out576503817|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~a$r_buff1_thd0~0_In576503817 |ULTIMATE.start_main_#t~ite52_Out576503817|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In576503817, ~a$w_buff0_used~0=~a$w_buff0_used~0_In576503817, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In576503817, ~a$w_buff1_used~0=~a$w_buff1_used~0_In576503817} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out576503817|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In576503817, ~a$w_buff0_used~0=~a$w_buff0_used~0_In576503817, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In576503817, ~a$w_buff1_used~0=~a$w_buff1_used~0_In576503817} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:26:14,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_17) (= v_~__unbuffered_p1_EBX~0_17 0) (= 0 v_~__unbuffered_p0_EAX~0_39) (= v_~main$tmp_guard1~0_12 0) (= 1 v_~__unbuffered_p1_EAX~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start_main_#t~ite52_30| v_~a$r_buff1_thd0~0_75) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_12 256)) (= v_~__unbuffered_p2_EBX~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_29|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:26:14,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:26:14 BasicIcfg [2019-12-18 12:26:14,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:26:14,650 INFO L168 Benchmark]: Toolchain (without parser) took 185170.36 ms. Allocated memory was 137.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 101.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 12:26:14,650 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 12:26:14,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 816.45 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.7 MB in the beginning and 155.5 MB in the end (delta: -54.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:26:14,651 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.23 ms. Allocated memory is still 201.9 MB. Free memory was 155.5 MB in the beginning and 152.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:26:14,651 INFO L168 Benchmark]: Boogie Preprocessor took 43.65 ms. Allocated memory is still 201.9 MB. Free memory was 152.5 MB in the beginning and 149.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:26:14,651 INFO L168 Benchmark]: RCFGBuilder took 862.34 ms. Allocated memory is still 201.9 MB. Free memory was 149.6 MB in the beginning and 99.6 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:26:14,656 INFO L168 Benchmark]: TraceAbstraction took 183373.28 ms. Allocated memory was 201.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 98.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 12:26:14,661 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 816.45 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.7 MB in the beginning and 155.5 MB in the end (delta: -54.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.23 ms. Allocated memory is still 201.9 MB. Free memory was 155.5 MB in the beginning and 152.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.65 ms. Allocated memory is still 201.9 MB. Free memory was 152.5 MB in the beginning and 149.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 862.34 ms. Allocated memory is still 201.9 MB. Free memory was 149.6 MB in the beginning and 99.6 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 183373.28 ms. Allocated memory was 201.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 98.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 179 ProgramPointsBefore, 95 ProgramPointsAfterwards, 216 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6646 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 59 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 91218 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L742] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L743] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L744] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L745] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L746] 1 a$r_buff0_thd1 = (_Bool)1 [L749] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L766] 2 x = 1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L841] FCALL, FORK 0 pthread_create(&t259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 183.0s, OverallIterations: 46, TraceHistogramMax: 1, AutomataDifference: 81.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 13768 SDtfs, 21941 SDslu, 55548 SDs, 0 SdLazy, 46486 SolverSat, 1223 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 983 GetRequests, 122 SyntacticMatches, 48 SemanticMatches, 813 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6129 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168271occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 64.9s AutomataMinimizationTime, 45 MinimizatonAttempts, 902113 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 2498 NumberOfCodeBlocks, 2498 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 2386 ConstructedInterpolants, 0 QuantifiedInterpolants, 682782 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 45 InterpolantComputations, 45 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...