/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:48:49,435 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:48:49,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:48:49,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:48:49,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:48:49,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:48:49,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:48:49,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:48:49,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:48:49,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:48:49,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:48:49,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:48:49,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:48:49,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:48:49,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:48:49,464 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:48:49,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:48:49,465 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:48:49,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:48:49,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:48:49,470 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:48:49,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:48:49,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:48:49,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:48:49,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:48:49,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:48:49,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:48:49,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:48:49,480 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:48:49,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:48:49,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:48:49,483 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:48:49,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:48:49,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:48:49,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:48:49,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:48:49,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:48:49,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:48:49,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:48:49,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:48:49,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:48:49,492 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:48:49,514 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:48:49,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:48:49,515 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:48:49,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:48:49,516 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:48:49,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:48:49,516 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:48:49,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:48:49,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:48:49,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:48:49,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:48:49,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:48:49,518 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:48:49,519 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:48:49,519 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:48:49,519 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:48:49,519 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:48:49,519 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:48:49,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:48:49,520 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:48:49,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:48:49,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:48:49,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:48:49,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:48:49,521 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:48:49,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:48:49,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:48:49,521 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:48:49,522 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:48:49,522 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:48:49,523 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:48:49,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:48:49,818 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:48:49,822 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:48:49,824 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:48:49,824 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:48:49,825 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_rmo.oepc.i [2019-12-27 16:48:49,906 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69ce2aeee/814dc3c1a309408598de5c168d3f5d49/FLAGd65a34645 [2019-12-27 16:48:50,455 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:48:50,456 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_rmo.oepc.i [2019-12-27 16:48:50,478 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69ce2aeee/814dc3c1a309408598de5c168d3f5d49/FLAGd65a34645 [2019-12-27 16:48:50,733 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69ce2aeee/814dc3c1a309408598de5c168d3f5d49 [2019-12-27 16:48:50,743 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:48:50,745 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:48:50,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:48:50,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:48:50,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:48:50,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:48:50" (1/1) ... [2019-12-27 16:48:50,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3a9b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:50, skipping insertion in model container [2019-12-27 16:48:50,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:48:50" (1/1) ... [2019-12-27 16:48:50,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:48:50,814 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:48:51,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:48:51,414 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:48:51,478 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:48:51,548 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:48:51,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:51 WrapperNode [2019-12-27 16:48:51,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:48:51,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:48:51,550 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:48:51,550 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:48:51,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:51" (1/1) ... [2019-12-27 16:48:51,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:51" (1/1) ... [2019-12-27 16:48:51,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:48:51,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:48:51,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:48:51,618 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:48:51,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:51" (1/1) ... [2019-12-27 16:48:51,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:51" (1/1) ... [2019-12-27 16:48:51,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:51" (1/1) ... [2019-12-27 16:48:51,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:51" (1/1) ... [2019-12-27 16:48:51,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:51" (1/1) ... [2019-12-27 16:48:51,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:51" (1/1) ... [2019-12-27 16:48:51,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:51" (1/1) ... [2019-12-27 16:48:51,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:48:51,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:48:51,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:48:51,653 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:48:51,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:51" (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-27 16:48:51,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:48:51,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:48:51,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:48:51,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:48:51,731 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:48:51,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:48:51,731 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:48:51,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:48:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:48:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:48:51,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:48:51,733 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:48:52,403 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:48:52,404 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:48:52,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:48:52 BoogieIcfgContainer [2019-12-27 16:48:52,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:48:52,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:48:52,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:48:52,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:48:52,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:48:50" (1/3) ... [2019-12-27 16:48:52,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd7c075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:48:52, skipping insertion in model container [2019-12-27 16:48:52,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:51" (2/3) ... [2019-12-27 16:48:52,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd7c075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:48:52, skipping insertion in model container [2019-12-27 16:48:52,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:48:52" (3/3) ... [2019-12-27 16:48:52,414 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_rmo.oepc.i [2019-12-27 16:48:52,424 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:48:52,425 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:48:52,433 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:48:52,434 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:48:52,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,476 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,477 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,477 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,478 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,478 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,497 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,497 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,566 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,567 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,567 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,577 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,580 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:52,596 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 16:48:52,617 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:48:52,617 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:48:52,618 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:48:52,618 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:48:52,618 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:48:52,618 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:48:52,618 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:48:52,618 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:48:52,637 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-12-27 16:48:52,639 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-27 16:48:52,724 INFO L132 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-27 16:48:52,724 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:48:52,738 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 16:48:52,757 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-27 16:48:52,801 INFO L132 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-27 16:48:52,801 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:48:52,807 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 16:48:52,822 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 16:48:52,823 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:48:57,844 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 16:48:57,954 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 16:48:58,180 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72636 [2019-12-27 16:48:58,181 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 16:48:58,184 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-27 16:48:58,764 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8766 states. [2019-12-27 16:48:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states. [2019-12-27 16:48:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:48:58,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:58,772 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:48:58,773 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:58,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:58,778 INFO L82 PathProgramCache]: Analyzing trace with hash 798122, now seen corresponding path program 1 times [2019-12-27 16:48:58,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:58,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386691759] [2019-12-27 16:48:58,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:59,021 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-27 16:48:59,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386691759] [2019-12-27 16:48:59,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:59,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:48:59,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1191254363] [2019-12-27 16:48:59,030 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:59,035 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:59,047 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:48:59,047 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:59,052 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:59,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:48:59,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:59,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:48:59,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:59,068 INFO L87 Difference]: Start difference. First operand 8766 states. Second operand 3 states. [2019-12-27 16:48:59,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:59,315 INFO L93 Difference]: Finished difference Result 8598 states and 28114 transitions. [2019-12-27 16:48:59,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:48:59,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:48:59,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:59,399 INFO L225 Difference]: With dead ends: 8598 [2019-12-27 16:48:59,399 INFO L226 Difference]: Without dead ends: 7662 [2019-12-27 16:48:59,400 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-27 16:48:59,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7662 states. [2019-12-27 16:48:59,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7662 to 7662. [2019-12-27 16:48:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7662 states. [2019-12-27 16:48:59,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7662 states to 7662 states and 24964 transitions. [2019-12-27 16:48:59,831 INFO L78 Accepts]: Start accepts. Automaton has 7662 states and 24964 transitions. Word has length 3 [2019-12-27 16:48:59,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:59,832 INFO L462 AbstractCegarLoop]: Abstraction has 7662 states and 24964 transitions. [2019-12-27 16:48:59,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:48:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand 7662 states and 24964 transitions. [2019-12-27 16:48:59,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:48:59,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:59,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:59,838 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:59,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:59,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1441761450, now seen corresponding path program 1 times [2019-12-27 16:48:59,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:59,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856969308] [2019-12-27 16:48:59,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:59,957 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-27 16:48:59,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856969308] [2019-12-27 16:48:59,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:59,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:48:59,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [883984248] [2019-12-27 16:48:59,958 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:59,959 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:59,961 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:48:59,962 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:59,962 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:59,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:48:59,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:59,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:48:59,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:59,964 INFO L87 Difference]: Start difference. First operand 7662 states and 24964 transitions. Second operand 3 states. [2019-12-27 16:48:59,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:59,995 INFO L93 Difference]: Finished difference Result 1232 states and 2811 transitions. [2019-12-27 16:48:59,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:48:59,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 16:48:59,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:00,002 INFO L225 Difference]: With dead ends: 1232 [2019-12-27 16:49:00,002 INFO L226 Difference]: Without dead ends: 1232 [2019-12-27 16:49:00,003 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-27 16:49:00,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-27 16:49:00,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-27 16:49:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-27 16:49:00,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2811 transitions. [2019-12-27 16:49:00,038 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2811 transitions. Word has length 11 [2019-12-27 16:49:00,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:00,038 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2811 transitions. [2019-12-27 16:49:00,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:49:00,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2811 transitions. [2019-12-27 16:49:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:49:00,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:00,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:00,041 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:00,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:00,041 INFO L82 PathProgramCache]: Analyzing trace with hash -973399749, now seen corresponding path program 1 times [2019-12-27 16:49:00,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:00,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710471314] [2019-12-27 16:49:00,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:00,159 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-27 16:49:00,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710471314] [2019-12-27 16:49:00,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:00,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:49:00,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1452349458] [2019-12-27 16:49:00,161 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:00,163 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:00,165 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 16:49:00,165 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:00,165 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:00,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:49:00,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:00,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:49:00,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:49:00,166 INFO L87 Difference]: Start difference. First operand 1232 states and 2811 transitions. Second operand 3 states. [2019-12-27 16:49:00,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:00,235 INFO L93 Difference]: Finished difference Result 1943 states and 4408 transitions. [2019-12-27 16:49:00,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:49:00,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 16:49:00,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:00,246 INFO L225 Difference]: With dead ends: 1943 [2019-12-27 16:49:00,247 INFO L226 Difference]: Without dead ends: 1943 [2019-12-27 16:49:00,247 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-27 16:49:00,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2019-12-27 16:49:00,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1365. [2019-12-27 16:49:00,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-12-27 16:49:00,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 3186 transitions. [2019-12-27 16:49:00,290 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 3186 transitions. Word has length 14 [2019-12-27 16:49:00,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:00,291 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 3186 transitions. [2019-12-27 16:49:00,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:49:00,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 3186 transitions. [2019-12-27 16:49:00,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:49:00,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:00,292 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:00,293 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:00,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:00,293 INFO L82 PathProgramCache]: Analyzing trace with hash -895424426, now seen corresponding path program 1 times [2019-12-27 16:49:00,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:00,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711865883] [2019-12-27 16:49:00,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:00,358 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-27 16:49:00,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711865883] [2019-12-27 16:49:00,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:00,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:49:00,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [995014262] [2019-12-27 16:49:00,360 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:00,362 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:00,364 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 16:49:00,364 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:00,365 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:00,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:49:00,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:00,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:49:00,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:49:00,366 INFO L87 Difference]: Start difference. First operand 1365 states and 3186 transitions. Second operand 4 states. [2019-12-27 16:49:00,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:00,554 INFO L93 Difference]: Finished difference Result 1724 states and 3916 transitions. [2019-12-27 16:49:00,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:49:00,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 16:49:00,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:00,564 INFO L225 Difference]: With dead ends: 1724 [2019-12-27 16:49:00,565 INFO L226 Difference]: Without dead ends: 1724 [2019-12-27 16:49:00,565 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-27 16:49:00,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2019-12-27 16:49:00,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1660. [2019-12-27 16:49:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-12-27 16:49:00,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 3792 transitions. [2019-12-27 16:49:00,608 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 3792 transitions. Word has length 14 [2019-12-27 16:49:00,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:00,609 INFO L462 AbstractCegarLoop]: Abstraction has 1660 states and 3792 transitions. [2019-12-27 16:49:00,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:49:00,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 3792 transitions. [2019-12-27 16:49:00,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:49:00,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:00,612 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:00,612 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:00,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:00,612 INFO L82 PathProgramCache]: Analyzing trace with hash -270244683, now seen corresponding path program 1 times [2019-12-27 16:49:00,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:00,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196706501] [2019-12-27 16:49:00,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:00,674 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-27 16:49:00,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196706501] [2019-12-27 16:49:00,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:00,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:49:00,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1484230668] [2019-12-27 16:49:00,675 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:00,676 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:00,678 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 16:49:00,679 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:00,679 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:00,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:49:00,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:00,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:49:00,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:49:00,680 INFO L87 Difference]: Start difference. First operand 1660 states and 3792 transitions. Second operand 4 states. [2019-12-27 16:49:00,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:00,857 INFO L93 Difference]: Finished difference Result 1991 states and 4482 transitions. [2019-12-27 16:49:00,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:49:00,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 16:49:00,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:00,869 INFO L225 Difference]: With dead ends: 1991 [2019-12-27 16:49:00,870 INFO L226 Difference]: Without dead ends: 1991 [2019-12-27 16:49:00,870 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-27 16:49:00,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-12-27 16:49:00,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1731. [2019-12-27 16:49:00,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2019-12-27 16:49:00,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 3946 transitions. [2019-12-27 16:49:00,916 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 3946 transitions. Word has length 14 [2019-12-27 16:49:00,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:00,917 INFO L462 AbstractCegarLoop]: Abstraction has 1731 states and 3946 transitions. [2019-12-27 16:49:00,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:49:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3946 transitions. [2019-12-27 16:49:00,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 16:49:00,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:00,920 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] [2019-12-27 16:49:00,920 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:00,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:00,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2057308803, now seen corresponding path program 1 times [2019-12-27 16:49:00,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:00,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171637108] [2019-12-27 16:49:00,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:00,979 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-27 16:49:00,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171637108] [2019-12-27 16:49:00,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:00,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:49:00,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1809895007] [2019-12-27 16:49:00,980 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:00,984 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:00,988 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 24 transitions. [2019-12-27 16:49:00,988 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:00,989 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:00,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:49:00,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:00,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:49:00,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:49:00,990 INFO L87 Difference]: Start difference. First operand 1731 states and 3946 transitions. Second operand 5 states. [2019-12-27 16:49:01,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:01,225 INFO L93 Difference]: Finished difference Result 2258 states and 4996 transitions. [2019-12-27 16:49:01,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:49:01,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-27 16:49:01,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:01,237 INFO L225 Difference]: With dead ends: 2258 [2019-12-27 16:49:01,238 INFO L226 Difference]: Without dead ends: 2258 [2019-12-27 16:49:01,238 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-27 16:49:01,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2019-12-27 16:49:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2002. [2019-12-27 16:49:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2019-12-27 16:49:01,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 4502 transitions. [2019-12-27 16:49:01,284 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 4502 transitions. Word has length 24 [2019-12-27 16:49:01,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:01,285 INFO L462 AbstractCegarLoop]: Abstraction has 2002 states and 4502 transitions. [2019-12-27 16:49:01,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:49:01,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 4502 transitions. [2019-12-27 16:49:01,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:49:01,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:01,287 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] [2019-12-27 16:49:01,288 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:01,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:01,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1461081411, now seen corresponding path program 1 times [2019-12-27 16:49:01,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:01,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179755511] [2019-12-27 16:49:01,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:01,332 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-27 16:49:01,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179755511] [2019-12-27 16:49:01,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:01,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:49:01,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1548915601] [2019-12-27 16:49:01,333 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:01,337 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:01,348 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 16:49:01,349 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:01,350 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:01,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:49:01,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:01,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:49:01,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:49:01,351 INFO L87 Difference]: Start difference. First operand 2002 states and 4502 transitions. Second operand 3 states. [2019-12-27 16:49:01,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:01,367 INFO L93 Difference]: Finished difference Result 2001 states and 4500 transitions. [2019-12-27 16:49:01,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:49:01,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 16:49:01,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:01,375 INFO L225 Difference]: With dead ends: 2001 [2019-12-27 16:49:01,375 INFO L226 Difference]: Without dead ends: 2001 [2019-12-27 16:49:01,376 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-27 16:49:01,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2019-12-27 16:49:01,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 2001. [2019-12-27 16:49:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2019-12-27 16:49:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 4500 transitions. [2019-12-27 16:49:01,464 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 4500 transitions. Word has length 26 [2019-12-27 16:49:01,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:01,465 INFO L462 AbstractCegarLoop]: Abstraction has 2001 states and 4500 transitions. [2019-12-27 16:49:01,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:49:01,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 4500 transitions. [2019-12-27 16:49:01,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:49:01,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:01,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] [2019-12-27 16:49:01,468 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:01,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:01,469 INFO L82 PathProgramCache]: Analyzing trace with hash 605769272, now seen corresponding path program 1 times [2019-12-27 16:49:01,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:01,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143972530] [2019-12-27 16:49:01,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:01,598 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-27 16:49:01,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143972530] [2019-12-27 16:49:01,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:01,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:49:01,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [865167345] [2019-12-27 16:49:01,599 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:01,604 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:01,611 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 16:49:01,611 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:01,611 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:01,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:49:01,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:01,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:49:01,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:49:01,612 INFO L87 Difference]: Start difference. First operand 2001 states and 4500 transitions. Second operand 5 states. [2019-12-27 16:49:01,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:01,840 INFO L93 Difference]: Finished difference Result 2378 states and 5234 transitions. [2019-12-27 16:49:01,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:49:01,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 16:49:01,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:01,847 INFO L225 Difference]: With dead ends: 2378 [2019-12-27 16:49:01,847 INFO L226 Difference]: Without dead ends: 2378 [2019-12-27 16:49:01,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:49:01,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2019-12-27 16:49:01,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 1851. [2019-12-27 16:49:01,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1851 states. [2019-12-27 16:49:01,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 4184 transitions. [2019-12-27 16:49:01,889 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 4184 transitions. Word has length 26 [2019-12-27 16:49:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:01,889 INFO L462 AbstractCegarLoop]: Abstraction has 1851 states and 4184 transitions. [2019-12-27 16:49:01,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:49:01,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 4184 transitions. [2019-12-27 16:49:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:49:01,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:01,892 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-27 16:49:01,892 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:01,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:01,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1750039425, now seen corresponding path program 1 times [2019-12-27 16:49:01,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:01,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330115722] [2019-12-27 16:49:01,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:01,961 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-27 16:49:01,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330115722] [2019-12-27 16:49:01,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:01,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:49:01,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1691997253] [2019-12-27 16:49:01,962 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:01,967 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:01,978 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 16:49:01,978 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:02,082 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:49:02,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:49:02,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:02,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:49:02,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:49:02,084 INFO L87 Difference]: Start difference. First operand 1851 states and 4184 transitions. Second operand 8 states. [2019-12-27 16:49:02,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:02,701 INFO L93 Difference]: Finished difference Result 2697 states and 5966 transitions. [2019-12-27 16:49:02,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:49:02,702 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 16:49:02,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:02,714 INFO L225 Difference]: With dead ends: 2697 [2019-12-27 16:49:02,714 INFO L226 Difference]: Without dead ends: 2697 [2019-12-27 16:49:02,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:49:02,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-12-27 16:49:02,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2381. [2019-12-27 16:49:02,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2381 states. [2019-12-27 16:49:02,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 5342 transitions. [2019-12-27 16:49:02,766 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 5342 transitions. Word has length 27 [2019-12-27 16:49:02,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:02,767 INFO L462 AbstractCegarLoop]: Abstraction has 2381 states and 5342 transitions. [2019-12-27 16:49:02,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:49:02,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 5342 transitions. [2019-12-27 16:49:02,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:49:02,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:02,776 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] [2019-12-27 16:49:02,776 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:02,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:02,777 INFO L82 PathProgramCache]: Analyzing trace with hash 93559855, now seen corresponding path program 1 times [2019-12-27 16:49:02,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:02,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019570183] [2019-12-27 16:49:02,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:02,844 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-27 16:49:02,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019570183] [2019-12-27 16:49:02,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:02,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:49:02,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2135954057] [2019-12-27 16:49:02,846 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:02,851 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:02,918 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 16:49:02,918 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:02,944 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:49:02,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:49:02,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:02,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:49:02,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:49:02,945 INFO L87 Difference]: Start difference. First operand 2381 states and 5342 transitions. Second operand 5 states. [2019-12-27 16:49:02,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:02,964 INFO L93 Difference]: Finished difference Result 1330 states and 2854 transitions. [2019-12-27 16:49:02,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:49:02,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 16:49:02,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:02,967 INFO L225 Difference]: With dead ends: 1330 [2019-12-27 16:49:02,968 INFO L226 Difference]: Without dead ends: 1330 [2019-12-27 16:49:02,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-27 16:49:02,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2019-12-27 16:49:02,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1235. [2019-12-27 16:49:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2019-12-27 16:49:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 2679 transitions. [2019-12-27 16:49:02,990 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 2679 transitions. Word has length 28 [2019-12-27 16:49:02,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:02,990 INFO L462 AbstractCegarLoop]: Abstraction has 1235 states and 2679 transitions. [2019-12-27 16:49:02,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:49:02,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 2679 transitions. [2019-12-27 16:49:02,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 16:49:02,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:02,994 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] [2019-12-27 16:49:02,994 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:02,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:02,994 INFO L82 PathProgramCache]: Analyzing trace with hash -466202404, now seen corresponding path program 1 times [2019-12-27 16:49:02,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:02,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596019761] [2019-12-27 16:49:02,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:03,081 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-27 16:49:03,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596019761] [2019-12-27 16:49:03,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:03,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:49:03,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [72076610] [2019-12-27 16:49:03,082 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:03,098 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:03,143 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 130 transitions. [2019-12-27 16:49:03,144 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:03,217 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:49:03,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:49:03,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:03,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:49:03,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:49:03,218 INFO L87 Difference]: Start difference. First operand 1235 states and 2679 transitions. Second operand 10 states. [2019-12-27 16:49:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:03,699 INFO L93 Difference]: Finished difference Result 3273 states and 6927 transitions. [2019-12-27 16:49:03,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 16:49:03,700 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-12-27 16:49:03,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:03,703 INFO L225 Difference]: With dead ends: 3273 [2019-12-27 16:49:03,703 INFO L226 Difference]: Without dead ends: 2143 [2019-12-27 16:49:03,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:49:03,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2019-12-27 16:49:03,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 1275. [2019-12-27 16:49:03,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-12-27 16:49:03,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 2768 transitions. [2019-12-27 16:49:03,733 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 2768 transitions. Word has length 50 [2019-12-27 16:49:03,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:03,733 INFO L462 AbstractCegarLoop]: Abstraction has 1275 states and 2768 transitions. [2019-12-27 16:49:03,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:49:03,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2768 transitions. [2019-12-27 16:49:03,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 16:49:03,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:03,736 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] [2019-12-27 16:49:03,736 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:03,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:03,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1410793752, now seen corresponding path program 2 times [2019-12-27 16:49:03,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:03,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220585013] [2019-12-27 16:49:03,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:03,789 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-27 16:49:03,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220585013] [2019-12-27 16:49:03,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:03,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:49:03,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2109085944] [2019-12-27 16:49:03,790 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:03,805 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:03,939 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 150 transitions. [2019-12-27 16:49:03,940 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:03,948 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:49:03,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:49:03,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:03,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:49:03,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:49:03,950 INFO L87 Difference]: Start difference. First operand 1275 states and 2768 transitions. Second operand 3 states. [2019-12-27 16:49:04,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:04,009 INFO L93 Difference]: Finished difference Result 1629 states and 3493 transitions. [2019-12-27 16:49:04,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:49:04,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 16:49:04,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:04,013 INFO L225 Difference]: With dead ends: 1629 [2019-12-27 16:49:04,013 INFO L226 Difference]: Without dead ends: 1629 [2019-12-27 16:49:04,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:49:04,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2019-12-27 16:49:04,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1344. [2019-12-27 16:49:04,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1344 states. [2019-12-27 16:49:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 2924 transitions. [2019-12-27 16:49:04,041 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 2924 transitions. Word has length 50 [2019-12-27 16:49:04,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:04,041 INFO L462 AbstractCegarLoop]: Abstraction has 1344 states and 2924 transitions. [2019-12-27 16:49:04,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:49:04,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 2924 transitions. [2019-12-27 16:49:04,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 16:49:04,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:04,044 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] [2019-12-27 16:49:04,045 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:04,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:04,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1876939711, now seen corresponding path program 1 times [2019-12-27 16:49:04,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:04,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611258754] [2019-12-27 16:49:04,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:04,324 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-27 16:49:04,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611258754] [2019-12-27 16:49:04,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:04,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:49:04,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1771614894] [2019-12-27 16:49:04,326 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:04,342 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:04,381 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 80 states and 99 transitions. [2019-12-27 16:49:04,381 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:04,462 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:49:04,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:49:04,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:04,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:49:04,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:49:04,463 INFO L87 Difference]: Start difference. First operand 1344 states and 2924 transitions. Second operand 12 states. [2019-12-27 16:49:05,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:05,801 INFO L93 Difference]: Finished difference Result 1933 states and 4015 transitions. [2019-12-27 16:49:05,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:49:05,802 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-12-27 16:49:05,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:05,808 INFO L225 Difference]: With dead ends: 1933 [2019-12-27 16:49:05,808 INFO L226 Difference]: Without dead ends: 1933 [2019-12-27 16:49:05,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 9 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 16:49:05,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2019-12-27 16:49:05,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1254. [2019-12-27 16:49:05,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2019-12-27 16:49:05,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 2686 transitions. [2019-12-27 16:49:05,837 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 2686 transitions. Word has length 51 [2019-12-27 16:49:05,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:05,837 INFO L462 AbstractCegarLoop]: Abstraction has 1254 states and 2686 transitions. [2019-12-27 16:49:05,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:49:05,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 2686 transitions. [2019-12-27 16:49:05,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 16:49:05,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:05,841 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] [2019-12-27 16:49:05,841 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:05,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:05,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1053790121, now seen corresponding path program 2 times [2019-12-27 16:49:05,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:05,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987979764] [2019-12-27 16:49:05,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:05,919 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-27 16:49:05,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987979764] [2019-12-27 16:49:05,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:05,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:49:05,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2120851663] [2019-12-27 16:49:05,920 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:05,934 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:05,983 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 113 transitions. [2019-12-27 16:49:05,984 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:05,984 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:05,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:49:05,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:05,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:49:05,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:49:05,985 INFO L87 Difference]: Start difference. First operand 1254 states and 2686 transitions. Second operand 3 states. [2019-12-27 16:49:06,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:06,004 INFO L93 Difference]: Finished difference Result 1253 states and 2684 transitions. [2019-12-27 16:49:06,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:49:06,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 16:49:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:06,009 INFO L225 Difference]: With dead ends: 1253 [2019-12-27 16:49:06,009 INFO L226 Difference]: Without dead ends: 1253 [2019-12-27 16:49:06,009 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-27 16:49:06,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2019-12-27 16:49:06,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 995. [2019-12-27 16:49:06,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-12-27 16:49:06,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 2166 transitions. [2019-12-27 16:49:06,037 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 2166 transitions. Word has length 51 [2019-12-27 16:49:06,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:06,037 INFO L462 AbstractCegarLoop]: Abstraction has 995 states and 2166 transitions. [2019-12-27 16:49:06,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:49:06,037 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 2166 transitions. [2019-12-27 16:49:06,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 16:49:06,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:06,040 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] [2019-12-27 16:49:06,040 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:06,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:06,040 INFO L82 PathProgramCache]: Analyzing trace with hash 860763375, now seen corresponding path program 1 times [2019-12-27 16:49:06,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:06,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492118320] [2019-12-27 16:49:06,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:49:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:49:06,250 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:49:06,250 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:49:06,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (= 0 |v_ULTIMATE.start_main_~#t905~0.offset_24|) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 v_~z$flush_delayed~0_37) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t905~0.base_35|)) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t905~0.base_35| 4) |v_#length_15|) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~z$r_buff1_thd0~0_141 0) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t905~0.base_35| 1)) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t905~0.base_35|) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t905~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t905~0.base_35|) |v_ULTIMATE.start_main_~#t905~0.offset_24| 0)) |v_#memory_int_15|) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ULTIMATE.start_main_~#t905~0.offset=|v_ULTIMATE.start_main_~#t905~0.offset_24|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_~#t906~0.base=|v_ULTIMATE.start_main_~#t906~0.base_17|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ULTIMATE.start_main_~#t906~0.offset=|v_ULTIMATE.start_main_~#t906~0.offset_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, ULTIMATE.start_main_~#t905~0.base=|v_ULTIMATE.start_main_~#t905~0.base_35|, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t905~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t906~0.base, ~z$r_buff1_thd0~0, #length, ULTIMATE.start_main_~#t906~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t905~0.base, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 16:49:06,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t906~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t906~0.base_13|) |v_ULTIMATE.start_main_~#t906~0.offset_11| 1))) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t906~0.base_13| 4)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t906~0.base_13|)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t906~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t906~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t906~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t906~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t906~0.base=|v_ULTIMATE.start_main_~#t906~0.base_13|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t906~0.offset=|v_ULTIMATE.start_main_~#t906~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t906~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t906~0.offset] because there is no mapped edge [2019-12-27 16:49:06,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff0~0_In-34269291 ~z$w_buff1~0_Out-34269291) (= 0 (mod ~z$w_buff1_used~0_Out-34269291 256)) (= P0Thread1of1ForFork0_~arg.base_Out-34269291 |P0Thread1of1ForFork0_#in~arg.base_In-34269291|) (= ~z$w_buff1_used~0_Out-34269291 ~z$w_buff0_used~0_In-34269291) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-34269291| 1) (= 1 ~z$w_buff0~0_Out-34269291) (= ~z$w_buff0_used~0_Out-34269291 1) (= P0Thread1of1ForFork0_~arg.offset_Out-34269291 |P0Thread1of1ForFork0_#in~arg.offset_In-34269291|) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-34269291| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-34269291)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-34269291|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-34269291, ~z$w_buff0~0=~z$w_buff0~0_In-34269291, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-34269291|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-34269291|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-34269291, ~z$w_buff0~0=~z$w_buff0~0_Out-34269291, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-34269291, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-34269291, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-34269291|, ~z$w_buff1~0=~z$w_buff1~0_Out-34269291, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-34269291, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-34269291|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-34269291} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 16:49:06,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-2097745378 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-2097745378 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-2097745378 256)) (and (= (mod ~z$w_buff1_used~0_In-2097745378 256) 0) .cse0) (and .cse0 (= (mod ~z$r_buff1_thd2~0_In-2097745378 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite23_Out-2097745378| |P1Thread1of1ForFork1_#t~ite24_Out-2097745378|) .cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out-2097745378| ~z$w_buff1_used~0_In-2097745378)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite23_In-2097745378| |P1Thread1of1ForFork1_#t~ite23_Out-2097745378|) (= ~z$w_buff1_used~0_In-2097745378 |P1Thread1of1ForFork1_#t~ite24_Out-2097745378|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2097745378, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2097745378, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2097745378, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-2097745378|, ~weak$$choice2~0=~weak$$choice2~0_In-2097745378, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2097745378} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2097745378, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2097745378, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-2097745378|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2097745378, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-2097745378|, ~weak$$choice2~0=~weak$$choice2~0_In-2097745378, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2097745378} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-27 16:49:06,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite29_47| |v_P1Thread1of1ForFork1_#t~ite29_46|) (= |v_P1Thread1of1ForFork1_#t~ite28_51| |v_P1Thread1of1ForFork1_#t~ite28_50|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_40|) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_47|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_51|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_46|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_40|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_26|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_50|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_31|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 16:49:06,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 16:49:06,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In1671633558 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1671633558 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1671633558| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1671633558| ~z$w_buff0_used~0_In1671633558) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1671633558, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1671633558} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1671633558|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1671633558, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1671633558} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 16:49:06,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In1131915936 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1131915936 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In1131915936 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1131915936 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1131915936|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1131915936 |P0Thread1of1ForFork0_#t~ite6_Out1131915936|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1131915936, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1131915936, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1131915936, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1131915936} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1131915936|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1131915936, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1131915936, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1131915936, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1131915936} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 16:49:06,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1802497854 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1802497854 256) 0))) (or (and (= ~z$r_buff0_thd1~0_In1802497854 ~z$r_buff0_thd1~0_Out1802497854) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out1802497854) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1802497854, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1802497854} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1802497854, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1802497854|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1802497854} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:49:06,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd1~0_In-1580570208 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1580570208 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1580570208 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1580570208 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1580570208| 0)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1580570208| ~z$r_buff1_thd1~0_In-1580570208) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1580570208, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1580570208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1580570208, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1580570208} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1580570208, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1580570208|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1580570208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1580570208, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1580570208} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 16:49:06,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1181975020 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In1181975020 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite33_Out1181975020| |P1Thread1of1ForFork1_#t~ite32_Out1181975020|))) (or (and (= ~z$w_buff1~0_In1181975020 |P1Thread1of1ForFork1_#t~ite32_Out1181975020|) (not .cse0) .cse1 (not .cse2)) (and (or .cse0 .cse2) .cse1 (= ~z~0_In1181975020 |P1Thread1of1ForFork1_#t~ite32_Out1181975020|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1181975020, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1181975020, ~z$w_buff1~0=~z$w_buff1~0_In1181975020, ~z~0=~z~0_In1181975020} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1181975020, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1181975020, ~z$w_buff1~0=~z$w_buff1~0_In1181975020, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1181975020|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1181975020|, ~z~0=~z~0_In1181975020} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 16:49:06,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1414520840 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1414520840 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1414520840| ~z$w_buff0_used~0_In1414520840)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1414520840| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1414520840, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1414520840} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1414520840, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1414520840|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1414520840} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 16:49:06,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-650419650 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-650419650 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-650419650 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-650419650 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-650419650|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite35_Out-650419650| ~z$w_buff1_used~0_In-650419650)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-650419650, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-650419650, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-650419650, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-650419650} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-650419650, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-650419650, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-650419650, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-650419650|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-650419650} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 16:49:06,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-506149203 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-506149203 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-506149203| 0)) (and (= ~z$r_buff0_thd2~0_In-506149203 |P1Thread1of1ForFork1_#t~ite36_Out-506149203|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-506149203, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-506149203} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-506149203, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-506149203, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-506149203|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 16:49:06,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1730587719 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1730587719 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1730587719 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1730587719 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In1730587719 |P1Thread1of1ForFork1_#t~ite37_Out1730587719|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1730587719|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1730587719, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1730587719, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1730587719, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1730587719} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1730587719, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1730587719, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1730587719, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1730587719, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1730587719|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 16:49:06,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_30|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 16:49:06,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:49:06,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= 2 v_~__unbuffered_cnt~0_22) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 16:49:06,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1126591553 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1126591553 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1126591553| ~z$w_buff1~0_In1126591553) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1126591553| ~z~0_In1126591553) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1126591553, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1126591553, ~z$w_buff1~0=~z$w_buff1~0_In1126591553, ~z~0=~z~0_In1126591553} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1126591553|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1126591553, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1126591553, ~z$w_buff1~0=~z$w_buff1~0_In1126591553, ~z~0=~z~0_In1126591553} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 16:49:06,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-27 16:49:06,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1872160581 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1872160581 256)))) (or (and (= ~z$w_buff0_used~0_In-1872160581 |ULTIMATE.start_main_#t~ite42_Out-1872160581|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-1872160581|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1872160581, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1872160581} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1872160581, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1872160581, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1872160581|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 16:49:06,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1567858820 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1567858820 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1567858820 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1567858820 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1567858820| ~z$w_buff1_used~0_In1567858820) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite43_Out1567858820| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1567858820, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1567858820, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1567858820, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1567858820} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1567858820, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1567858820, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1567858820, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1567858820, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1567858820|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 16:49:06,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1382181179 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1382181179 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1382181179| ~z$r_buff0_thd0~0_In-1382181179) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1382181179| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1382181179, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1382181179} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1382181179, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1382181179, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1382181179|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 16:49:06,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-579728674 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-579728674 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-579728674 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-579728674 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-579728674|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-579728674 |ULTIMATE.start_main_#t~ite45_Out-579728674|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-579728674, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-579728674, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-579728674, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-579728674} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-579728674, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-579728674, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-579728674, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-579728674, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-579728674|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 16:49:06,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= 1 v_~__unbuffered_p1_EAX~0_22) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:49:06,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:49:06 BasicIcfg [2019-12-27 16:49:06,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:49:06,376 INFO L168 Benchmark]: Toolchain (without parser) took 15631.03 ms. Allocated memory was 144.7 MB in the beginning and 520.1 MB in the end (delta: 375.4 MB). Free memory was 101.5 MB in the beginning and 245.9 MB in the end (delta: -144.4 MB). Peak memory consumption was 231.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:06,376 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 16:49:06,377 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.37 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 101.0 MB in the beginning and 154.9 MB in the end (delta: -53.9 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:06,378 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.51 ms. Allocated memory is still 202.4 MB. Free memory was 154.9 MB in the beginning and 152.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:06,378 INFO L168 Benchmark]: Boogie Preprocessor took 35.00 ms. Allocated memory is still 202.4 MB. Free memory was 152.1 MB in the beginning and 150.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:06,379 INFO L168 Benchmark]: RCFGBuilder took 752.79 ms. Allocated memory is still 202.4 MB. Free memory was 150.1 MB in the beginning and 105.8 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:06,380 INFO L168 Benchmark]: TraceAbstraction took 13967.25 ms. Allocated memory was 202.4 MB in the beginning and 520.1 MB in the end (delta: 317.7 MB). Free memory was 105.1 MB in the beginning and 245.9 MB in the end (delta: -140.8 MB). Peak memory consumption was 176.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:06,384 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.17 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 803.37 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 101.0 MB in the beginning and 154.9 MB in the end (delta: -53.9 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.51 ms. Allocated memory is still 202.4 MB. Free memory was 154.9 MB in the beginning and 152.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.00 ms. Allocated memory is still 202.4 MB. Free memory was 152.1 MB in the beginning and 150.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 752.79 ms. Allocated memory is still 202.4 MB. Free memory was 150.1 MB in the beginning and 105.8 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13967.25 ms. Allocated memory was 202.4 MB in the beginning and 520.1 MB in the end (delta: 317.7 MB). Free memory was 105.1 MB in the beginning and 245.9 MB in the end (delta: -140.8 MB). Peak memory consumption was 176.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 149 ProgramPointsBefore, 76 ProgramPointsAfterwards, 183 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 11 FixpointIterations, 31 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4657 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 137 SemBasedMoverChecksPositive, 234 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 72636 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t905, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] FCALL, FORK 0 pthread_create(&t906, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.6s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1786 SDtfs, 1604 SDslu, 4248 SDs, 0 SdLazy, 2645 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 32 SyntacticMatches, 19 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8766occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 4186 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 441 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 375 ConstructedInterpolants, 0 QuantifiedInterpolants, 48491 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...