/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 08:10:44,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 08:10:44,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 08:10:44,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 08:10:44,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 08:10:44,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 08:10:44,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 08:10:44,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 08:10:44,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 08:10:44,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 08:10:44,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 08:10:44,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 08:10:44,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 08:10:44,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 08:10:44,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 08:10:44,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 08:10:44,462 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 08:10:44,463 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 08:10:44,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 08:10:44,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 08:10:44,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 08:10:44,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 08:10:44,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 08:10:44,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 08:10:44,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 08:10:44,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 08:10:44,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 08:10:44,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 08:10:44,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 08:10:44,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 08:10:44,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 08:10:44,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 08:10:44,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 08:10:44,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 08:10:44,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 08:10:44,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 08:10:44,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 08:10:44,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 08:10:44,495 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 08:10:44,496 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 08:10:44,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 08:10:44,498 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-VariableLbe.epf [2019-12-27 08:10:44,514 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 08:10:44,515 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 08:10:44,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 08:10:44,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 08:10:44,516 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 08:10:44,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 08:10:44,517 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 08:10:44,517 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 08:10:44,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 08:10:44,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 08:10:44,517 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 08:10:44,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 08:10:44,518 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 08:10:44,518 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 08:10:44,518 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 08:10:44,518 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 08:10:44,519 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 08:10:44,519 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 08:10:44,519 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 08:10:44,519 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 08:10:44,519 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 08:10:44,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:10:44,520 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 08:10:44,520 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 08:10:44,520 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 08:10:44,520 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 08:10:44,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 08:10:44,521 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 08:10:44,521 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 08:10:44,521 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 08:10:44,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 08:10:44,828 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 08:10:44,833 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 08:10:44,834 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 08:10:44,835 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 08:10:44,836 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc.i [2019-12-27 08:10:44,913 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cd61c668/cb36998d76f94a92912120053eb208b2/FLAGfd1ac2733 [2019-12-27 08:10:45,500 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 08:10:45,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_power.oepc.i [2019-12-27 08:10:45,515 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cd61c668/cb36998d76f94a92912120053eb208b2/FLAGfd1ac2733 [2019-12-27 08:10:45,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cd61c668/cb36998d76f94a92912120053eb208b2 [2019-12-27 08:10:45,824 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 08:10:45,827 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 08:10:45,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 08:10:45,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 08:10:45,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 08:10:45,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:10:45" (1/1) ... [2019-12-27 08:10:45,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66648c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:45, skipping insertion in model container [2019-12-27 08:10:45,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:10:45" (1/1) ... [2019-12-27 08:10:45,843 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 08:10:45,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 08:10:46,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:10:46,381 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 08:10:46,464 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:10:46,533 INFO L208 MainTranslator]: Completed translation [2019-12-27 08:10:46,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46 WrapperNode [2019-12-27 08:10:46,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 08:10:46,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 08:10:46,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 08:10:46,534 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 08:10:46,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46" (1/1) ... [2019-12-27 08:10:46,565 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46" (1/1) ... [2019-12-27 08:10:46,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 08:10:46,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 08:10:46,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 08:10:46,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 08:10:46,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46" (1/1) ... [2019-12-27 08:10:46,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46" (1/1) ... [2019-12-27 08:10:46,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46" (1/1) ... [2019-12-27 08:10:46,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46" (1/1) ... [2019-12-27 08:10:46,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46" (1/1) ... [2019-12-27 08:10:46,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46" (1/1) ... [2019-12-27 08:10:46,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46" (1/1) ... [2019-12-27 08:10:46,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 08:10:46,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 08:10:46,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 08:10:46,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 08:10:46,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46" (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 08:10:46,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 08:10:46,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 08:10:46,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 08:10:46,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 08:10:46,701 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 08:10:46,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 08:10:46,701 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 08:10:46,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 08:10:46,702 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 08:10:46,702 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 08:10:46,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 08:10:46,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 08:10:46,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 08:10:46,704 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 08:10:47,407 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 08:10:47,407 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 08:10:47,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:10:47 BoogieIcfgContainer [2019-12-27 08:10:47,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 08:10:47,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 08:10:47,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 08:10:47,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 08:10:47,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:10:45" (1/3) ... [2019-12-27 08:10:47,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44341126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:10:47, skipping insertion in model container [2019-12-27 08:10:47,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46" (2/3) ... [2019-12-27 08:10:47,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44341126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:10:47, skipping insertion in model container [2019-12-27 08:10:47,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:10:47" (3/3) ... [2019-12-27 08:10:47,422 INFO L109 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc.i [2019-12-27 08:10:47,433 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 08:10:47,433 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 08:10:47,440 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 08:10:47,441 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 08:10:47,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,478 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,479 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,482 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,482 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,515 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,515 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,516 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,524 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,524 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,539 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,539 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,558 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,562 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,565 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,565 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,566 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:47,583 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 08:10:47,603 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:10:47,603 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:10:47,603 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:10:47,603 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:10:47,603 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:10:47,603 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:10:47,603 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:10:47,604 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:10:47,619 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-12-27 08:10:47,620 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-27 08:10:47,709 INFO L132 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-27 08:10:47,710 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:10:47,723 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 342 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 08:10:47,742 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-27 08:10:47,789 INFO L132 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-27 08:10:47,790 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:10:47,795 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 342 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 08:10:47,810 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-27 08:10:47,811 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:10:48,602 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-12-27 08:10:50,830 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-27 08:10:51,256 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 08:10:51,381 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 08:10:51,403 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48572 [2019-12-27 08:10:51,403 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 08:10:51,406 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 83 transitions [2019-12-27 08:10:52,291 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14526 states. [2019-12-27 08:10:52,293 INFO L276 IsEmpty]: Start isEmpty. Operand 14526 states. [2019-12-27 08:10:52,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 08:10:52,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:52,300 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:10:52,300 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:52,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:52,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1566852802, now seen corresponding path program 1 times [2019-12-27 08:10:52,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:52,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363761269] [2019-12-27 08:10:52,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:52,569 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 08:10:52,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363761269] [2019-12-27 08:10:52,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:52,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:10:52,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692875402] [2019-12-27 08:10:52,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:10:52,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:52,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:10:52,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:52,595 INFO L87 Difference]: Start difference. First operand 14526 states. Second operand 3 states. [2019-12-27 08:10:52,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:52,982 INFO L93 Difference]: Finished difference Result 13996 states and 53893 transitions. [2019-12-27 08:10:52,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:10:52,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 08:10:52,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:53,170 INFO L225 Difference]: With dead ends: 13996 [2019-12-27 08:10:53,171 INFO L226 Difference]: Without dead ends: 13156 [2019-12-27 08:10:53,173 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 08:10:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13156 states. [2019-12-27 08:10:53,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13156 to 13156. [2019-12-27 08:10:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13156 states. [2019-12-27 08:10:54,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13156 states to 13156 states and 50585 transitions. [2019-12-27 08:10:54,043 INFO L78 Accepts]: Start accepts. Automaton has 13156 states and 50585 transitions. Word has length 7 [2019-12-27 08:10:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:54,044 INFO L462 AbstractCegarLoop]: Abstraction has 13156 states and 50585 transitions. [2019-12-27 08:10:54,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:10:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 13156 states and 50585 transitions. [2019-12-27 08:10:54,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 08:10:54,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:54,055 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:10:54,056 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:54,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:54,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1632341996, now seen corresponding path program 1 times [2019-12-27 08:10:54,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:54,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166817248] [2019-12-27 08:10:54,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:54,221 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 08:10:54,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166817248] [2019-12-27 08:10:54,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:54,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:10:54,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264373055] [2019-12-27 08:10:54,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:10:54,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:54,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:10:54,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:10:54,228 INFO L87 Difference]: Start difference. First operand 13156 states and 50585 transitions. Second operand 4 states. [2019-12-27 08:10:55,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:55,712 INFO L93 Difference]: Finished difference Result 19646 states and 72584 transitions. [2019-12-27 08:10:55,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:10:55,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 08:10:55,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:55,824 INFO L225 Difference]: With dead ends: 19646 [2019-12-27 08:10:55,824 INFO L226 Difference]: Without dead ends: 19616 [2019-12-27 08:10:55,827 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 08:10:56,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19616 states. [2019-12-27 08:10:56,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19616 to 17838. [2019-12-27 08:10:56,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17838 states. [2019-12-27 08:10:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17838 states to 17838 states and 66884 transitions. [2019-12-27 08:10:56,671 INFO L78 Accepts]: Start accepts. Automaton has 17838 states and 66884 transitions. Word has length 13 [2019-12-27 08:10:56,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:56,671 INFO L462 AbstractCegarLoop]: Abstraction has 17838 states and 66884 transitions. [2019-12-27 08:10:56,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:10:56,672 INFO L276 IsEmpty]: Start isEmpty. Operand 17838 states and 66884 transitions. [2019-12-27 08:10:56,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 08:10:56,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:56,677 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:10:56,678 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:56,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:56,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1674715579, now seen corresponding path program 1 times [2019-12-27 08:10:56,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:56,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019848144] [2019-12-27 08:10:56,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:56,814 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 08:10:56,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019848144] [2019-12-27 08:10:56,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:56,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:10:56,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964364496] [2019-12-27 08:10:56,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:10:56,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:56,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:10:56,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:10:56,817 INFO L87 Difference]: Start difference. First operand 17838 states and 66884 transitions. Second operand 5 states. [2019-12-27 08:10:57,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:57,260 INFO L93 Difference]: Finished difference Result 24700 states and 90839 transitions. [2019-12-27 08:10:57,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 08:10:57,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 08:10:57,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:57,598 INFO L225 Difference]: With dead ends: 24700 [2019-12-27 08:10:57,599 INFO L226 Difference]: Without dead ends: 24662 [2019-12-27 08:10:57,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:10:57,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24662 states. [2019-12-27 08:10:58,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24662 to 21030. [2019-12-27 08:10:58,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21030 states. [2019-12-27 08:10:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21030 states to 21030 states and 78424 transitions. [2019-12-27 08:10:59,527 INFO L78 Accepts]: Start accepts. Automaton has 21030 states and 78424 transitions. Word has length 16 [2019-12-27 08:10:59,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:59,528 INFO L462 AbstractCegarLoop]: Abstraction has 21030 states and 78424 transitions. [2019-12-27 08:10:59,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:10:59,528 INFO L276 IsEmpty]: Start isEmpty. Operand 21030 states and 78424 transitions. [2019-12-27 08:10:59,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 08:10:59,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:59,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:10:59,542 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:59,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:59,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1310988069, now seen corresponding path program 1 times [2019-12-27 08:10:59,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:59,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4631360] [2019-12-27 08:10:59,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:59,596 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 08:10:59,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4631360] [2019-12-27 08:10:59,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:59,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:10:59,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743164432] [2019-12-27 08:10:59,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:10:59,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:59,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:10:59,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:59,599 INFO L87 Difference]: Start difference. First operand 21030 states and 78424 transitions. Second operand 3 states. [2019-12-27 08:10:59,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:59,706 INFO L93 Difference]: Finished difference Result 20886 states and 77807 transitions. [2019-12-27 08:10:59,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:10:59,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 08:10:59,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:59,794 INFO L225 Difference]: With dead ends: 20886 [2019-12-27 08:10:59,794 INFO L226 Difference]: Without dead ends: 20886 [2019-12-27 08:10:59,795 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 08:10:59,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20886 states. [2019-12-27 08:11:00,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20886 to 20886. [2019-12-27 08:11:00,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20886 states. [2019-12-27 08:11:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20886 states to 20886 states and 77807 transitions. [2019-12-27 08:11:00,630 INFO L78 Accepts]: Start accepts. Automaton has 20886 states and 77807 transitions. Word has length 18 [2019-12-27 08:11:00,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:11:00,631 INFO L462 AbstractCegarLoop]: Abstraction has 20886 states and 77807 transitions. [2019-12-27 08:11:00,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:11:00,631 INFO L276 IsEmpty]: Start isEmpty. Operand 20886 states and 77807 transitions. [2019-12-27 08:11:00,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:11:00,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:11:00,640 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:11:00,640 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:11:00,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:11:00,641 INFO L82 PathProgramCache]: Analyzing trace with hash 718938577, now seen corresponding path program 1 times [2019-12-27 08:11:00,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:11:00,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058589872] [2019-12-27 08:11:00,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:11:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:11:00,694 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 08:11:00,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058589872] [2019-12-27 08:11:00,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:11:00,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:11:00,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486819777] [2019-12-27 08:11:00,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:11:00,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:11:00,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:11:00,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:11:00,696 INFO L87 Difference]: Start difference. First operand 20886 states and 77807 transitions. Second operand 3 states. [2019-12-27 08:11:00,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:11:00,820 INFO L93 Difference]: Finished difference Result 19848 states and 73020 transitions. [2019-12-27 08:11:00,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:11:00,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-27 08:11:00,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:11:00,877 INFO L225 Difference]: With dead ends: 19848 [2019-12-27 08:11:00,877 INFO L226 Difference]: Without dead ends: 19848 [2019-12-27 08:11:00,878 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 08:11:01,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19848 states. [2019-12-27 08:11:01,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19848 to 19584. [2019-12-27 08:11:01,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19584 states. [2019-12-27 08:11:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19584 states to 19584 states and 72120 transitions. [2019-12-27 08:11:01,665 INFO L78 Accepts]: Start accepts. Automaton has 19584 states and 72120 transitions. Word has length 19 [2019-12-27 08:11:01,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:11:01,665 INFO L462 AbstractCegarLoop]: Abstraction has 19584 states and 72120 transitions. [2019-12-27 08:11:01,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:11:01,666 INFO L276 IsEmpty]: Start isEmpty. Operand 19584 states and 72120 transitions. [2019-12-27 08:11:01,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:11:01,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:11:01,672 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:11:01,673 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:11:01,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:11:01,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1055276181, now seen corresponding path program 1 times [2019-12-27 08:11:01,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:11:01,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250426346] [2019-12-27 08:11:01,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:11:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:11:01,742 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 08:11:01,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250426346] [2019-12-27 08:11:01,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:11:01,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:11:01,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274210130] [2019-12-27 08:11:01,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:11:01,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:11:01,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:11:01,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:11:01,744 INFO L87 Difference]: Start difference. First operand 19584 states and 72120 transitions. Second operand 5 states. [2019-12-27 08:11:01,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:11:01,811 INFO L93 Difference]: Finished difference Result 3154 states and 9583 transitions. [2019-12-27 08:11:01,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:11:01,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 08:11:01,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:11:01,816 INFO L225 Difference]: With dead ends: 3154 [2019-12-27 08:11:01,817 INFO L226 Difference]: Without dead ends: 2062 [2019-12-27 08:11:01,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:11:01,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2019-12-27 08:11:01,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 2062. [2019-12-27 08:11:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2062 states. [2019-12-27 08:11:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 5476 transitions. [2019-12-27 08:11:01,859 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 5476 transitions. Word has length 19 [2019-12-27 08:11:01,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:11:01,859 INFO L462 AbstractCegarLoop]: Abstraction has 2062 states and 5476 transitions. [2019-12-27 08:11:01,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:11:01,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 5476 transitions. [2019-12-27 08:11:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 08:11:01,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:11:01,863 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] [2019-12-27 08:11:01,863 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:11:01,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:11:01,863 INFO L82 PathProgramCache]: Analyzing trace with hash -322199084, now seen corresponding path program 1 times [2019-12-27 08:11:01,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:11:01,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656562930] [2019-12-27 08:11:01,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:11:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:11:01,907 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 08:11:01,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656562930] [2019-12-27 08:11:01,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:11:01,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:11:01,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083569363] [2019-12-27 08:11:01,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:11:01,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:11:01,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:11:01,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:11:01,909 INFO L87 Difference]: Start difference. First operand 2062 states and 5476 transitions. Second operand 3 states. [2019-12-27 08:11:01,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:11:01,955 INFO L93 Difference]: Finished difference Result 2908 states and 7451 transitions. [2019-12-27 08:11:01,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:11:01,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-27 08:11:01,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:11:01,960 INFO L225 Difference]: With dead ends: 2908 [2019-12-27 08:11:01,960 INFO L226 Difference]: Without dead ends: 2908 [2019-12-27 08:11:01,961 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 08:11:01,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2019-12-27 08:11:01,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2158. [2019-12-27 08:11:01,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2158 states. [2019-12-27 08:11:02,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 2158 states and 5618 transitions. [2019-12-27 08:11:02,001 INFO L78 Accepts]: Start accepts. Automaton has 2158 states and 5618 transitions. Word has length 29 [2019-12-27 08:11:02,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:11:02,002 INFO L462 AbstractCegarLoop]: Abstraction has 2158 states and 5618 transitions. [2019-12-27 08:11:02,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:11:02,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 5618 transitions. [2019-12-27 08:11:02,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 08:11:02,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:11:02,006 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] [2019-12-27 08:11:02,006 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:11:02,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:11:02,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1477101190, now seen corresponding path program 1 times [2019-12-27 08:11:02,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:11:02,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160086967] [2019-12-27 08:11:02,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:11:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:11:02,085 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 08:11:02,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160086967] [2019-12-27 08:11:02,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:11:02,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:11:02,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712110134] [2019-12-27 08:11:02,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:11:02,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:11:02,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:11:02,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:11:02,087 INFO L87 Difference]: Start difference. First operand 2158 states and 5618 transitions. Second operand 6 states. [2019-12-27 08:11:02,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:11:02,487 INFO L93 Difference]: Finished difference Result 3388 states and 8561 transitions. [2019-12-27 08:11:02,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 08:11:02,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 08:11:02,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:11:02,492 INFO L225 Difference]: With dead ends: 3388 [2019-12-27 08:11:02,492 INFO L226 Difference]: Without dead ends: 3384 [2019-12-27 08:11:02,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 08:11:02,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2019-12-27 08:11:02,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 2198. [2019-12-27 08:11:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2198 states. [2019-12-27 08:11:02,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 5719 transitions. [2019-12-27 08:11:02,535 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 5719 transitions. Word has length 29 [2019-12-27 08:11:02,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:11:02,536 INFO L462 AbstractCegarLoop]: Abstraction has 2198 states and 5719 transitions. [2019-12-27 08:11:02,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:11:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 5719 transitions. [2019-12-27 08:11:02,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 08:11:02,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:11:02,540 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] [2019-12-27 08:11:02,540 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:11:02,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:11:02,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1866363017, now seen corresponding path program 1 times [2019-12-27 08:11:02,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:11:02,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789685353] [2019-12-27 08:11:02,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:11:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:11:02,583 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 08:11:02,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789685353] [2019-12-27 08:11:02,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:11:02,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:11:02,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511948661] [2019-12-27 08:11:02,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:11:02,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:11:02,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:11:02,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:11:02,586 INFO L87 Difference]: Start difference. First operand 2198 states and 5719 transitions. Second operand 3 states. [2019-12-27 08:11:02,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:11:02,605 INFO L93 Difference]: Finished difference Result 3475 states and 8699 transitions. [2019-12-27 08:11:02,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:11:02,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-27 08:11:02,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:11:02,609 INFO L225 Difference]: With dead ends: 3475 [2019-12-27 08:11:02,610 INFO L226 Difference]: Without dead ends: 2220 [2019-12-27 08:11:02,610 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 08:11:02,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2019-12-27 08:11:02,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 2192. [2019-12-27 08:11:02,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-12-27 08:11:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 5606 transitions. [2019-12-27 08:11:02,656 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 5606 transitions. Word has length 30 [2019-12-27 08:11:02,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:11:02,656 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 5606 transitions. [2019-12-27 08:11:02,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:11:02,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 5606 transitions. [2019-12-27 08:11:02,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 08:11:02,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:11:02,661 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] [2019-12-27 08:11:02,661 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:11:02,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:11:02,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1983062445, now seen corresponding path program 2 times [2019-12-27 08:11:02,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:11:02,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401814068] [2019-12-27 08:11:02,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:11:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:11:02,742 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 08:11:02,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401814068] [2019-12-27 08:11:02,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:11:02,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:11:02,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927768925] [2019-12-27 08:11:02,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:11:02,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:11:02,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:11:02,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:11:02,744 INFO L87 Difference]: Start difference. First operand 2192 states and 5606 transitions. Second operand 6 states. [2019-12-27 08:11:02,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:11:02,874 INFO L93 Difference]: Finished difference Result 1375 states and 3652 transitions. [2019-12-27 08:11:02,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:11:02,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-27 08:11:02,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:11:02,877 INFO L225 Difference]: With dead ends: 1375 [2019-12-27 08:11:02,877 INFO L226 Difference]: Without dead ends: 1167 [2019-12-27 08:11:02,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:11:02,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2019-12-27 08:11:02,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1167. [2019-12-27 08:11:02,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2019-12-27 08:11:02,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 3116 transitions. [2019-12-27 08:11:02,896 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 3116 transitions. Word has length 30 [2019-12-27 08:11:02,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:11:02,896 INFO L462 AbstractCegarLoop]: Abstraction has 1167 states and 3116 transitions. [2019-12-27 08:11:02,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:11:02,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 3116 transitions. [2019-12-27 08:11:02,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 08:11:02,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:11:02,900 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] [2019-12-27 08:11:02,900 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:11:02,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:11:02,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1530514123, now seen corresponding path program 1 times [2019-12-27 08:11:02,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:11:02,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507604251] [2019-12-27 08:11:02,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:11:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:11:02,944 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 08:11:02,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507604251] [2019-12-27 08:11:02,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:11:02,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:11:02,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589394074] [2019-12-27 08:11:02,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:11:02,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:11:02,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:11:02,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:11:02,946 INFO L87 Difference]: Start difference. First operand 1167 states and 3116 transitions. Second operand 3 states. [2019-12-27 08:11:02,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:11:02,982 INFO L93 Difference]: Finished difference Result 1365 states and 3501 transitions. [2019-12-27 08:11:02,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:11:02,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-12-27 08:11:02,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:11:02,985 INFO L225 Difference]: With dead ends: 1365 [2019-12-27 08:11:02,985 INFO L226 Difference]: Without dead ends: 1365 [2019-12-27 08:11:02,986 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 08:11:02,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2019-12-27 08:11:03,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1217. [2019-12-27 08:11:03,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-27 08:11:03,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3165 transitions. [2019-12-27 08:11:03,004 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3165 transitions. Word has length 45 [2019-12-27 08:11:03,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:11:03,004 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3165 transitions. [2019-12-27 08:11:03,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:11:03,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3165 transitions. [2019-12-27 08:11:03,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 08:11:03,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:11:03,007 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] [2019-12-27 08:11:03,007 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:11:03,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:11:03,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1335944749, now seen corresponding path program 1 times [2019-12-27 08:11:03,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:11:03,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327513018] [2019-12-27 08:11:03,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:11:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:11:03,101 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 08:11:03,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327513018] [2019-12-27 08:11:03,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:11:03,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:11:03,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651811560] [2019-12-27 08:11:03,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:11:03,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:11:03,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:11:03,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:11:03,103 INFO L87 Difference]: Start difference. First operand 1217 states and 3165 transitions. Second operand 7 states. [2019-12-27 08:11:03,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:11:03,358 INFO L93 Difference]: Finished difference Result 3292 states and 8509 transitions. [2019-12-27 08:11:03,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 08:11:03,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-27 08:11:03,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:11:03,362 INFO L225 Difference]: With dead ends: 3292 [2019-12-27 08:11:03,363 INFO L226 Difference]: Without dead ends: 2192 [2019-12-27 08:11:03,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 08:11:03,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-12-27 08:11:03,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1366. [2019-12-27 08:11:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1366 states. [2019-12-27 08:11:03,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 3532 transitions. [2019-12-27 08:11:03,389 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 3532 transitions. Word has length 45 [2019-12-27 08:11:03,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:11:03,389 INFO L462 AbstractCegarLoop]: Abstraction has 1366 states and 3532 transitions. [2019-12-27 08:11:03,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:11:03,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 3532 transitions. [2019-12-27 08:11:03,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 08:11:03,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:11:03,393 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] [2019-12-27 08:11:03,393 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:11:03,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:11:03,393 INFO L82 PathProgramCache]: Analyzing trace with hash 2093039597, now seen corresponding path program 2 times [2019-12-27 08:11:03,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:11:03,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392848344] [2019-12-27 08:11:03,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:11:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:11:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:11:03,502 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:11:03,502 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:11:03,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~x~0_11 0) (= 0 v_~__unbuffered_p0_EAX~0_13) (= 0 v_~__unbuffered_p1_EAX~0_13) (= v_~y~0_23 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2577~0.base_27|) (= v_~y$r_buff0_thd1~0_10 0) (= v_~z~0_18 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2577~0.base_27| 4) |v_#length_25|) (= 0 v_~y$w_buff1~0_22) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2577~0.base_27|)) (= v_~main$tmp_guard0~0_12 0) (= 0 v_~y$flush_delayed~0_14) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff0_thd2~0_67 0) (= 0 v_~y$r_buff1_thd2~0_39) (= 0 v_~y$r_buff1_thd0~0_24) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2577~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2577~0.base_27|) |v_ULTIMATE.start_main_~#t2577~0.offset_21| 0)) |v_#memory_int_23|) (= v_~y$r_buff0_thd0~0_22 0) (= v_~y$mem_tmp~0_11 0) (= v_~y$r_buff1_thd1~0_8 0) (= 0 v_~weak$$choice2~0_33) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0_used~0_94) (= |v_#NULL.offset_5| 0) (= 0 v_~y$w_buff0~0_27) (= v_~y$w_buff1_used~0_55 0) (= 0 |v_ULTIMATE.start_main_~#t2577~0.offset_21|) (= v_~y$r_buff0_thd3~0_27 0) (= 0 v_~__unbuffered_cnt~0_18) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t2577~0.base_27| 1)) (= 0 |v_#NULL.base_5|) (= 0 v_~y$r_buff1_thd3~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t2578~0.offset=|v_ULTIMATE.start_main_~#t2578~0.offset_19|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ULTIMATE.start_main_~#t2577~0.base=|v_ULTIMATE.start_main_~#t2577~0.base_27|, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_11|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|, ~y$w_buff1~0=v_~y$w_buff1~0_22, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ULTIMATE.start_main_~#t2578~0.base=|v_ULTIMATE.start_main_~#t2578~0.base_25|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_11, ULTIMATE.start_main_~#t2579~0.offset=|v_ULTIMATE.start_main_~#t2579~0.offset_16|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_8, ULTIMATE.start_main_~#t2579~0.base=|v_ULTIMATE.start_main_~#t2579~0.base_21|, ~y$w_buff0~0=v_~y$w_buff0~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y~0=v_~y~0_23, ULTIMATE.start_main_~#t2577~0.offset=|v_ULTIMATE.start_main_~#t2577~0.offset_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_39, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_18, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2579~0.offset, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2578~0.offset, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t2579~0.base, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2577~0.base, #length, ~y~0, ULTIMATE.start_main_~#t2577~0.offset, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2578~0.base, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 08:11:03,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L814-1-->L816: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2578~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2578~0.base_10|) |v_ULTIMATE.start_main_~#t2578~0.offset_9| 1)) |v_#memory_int_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2578~0.base_10| 4) |v_#length_13|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2578~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t2578~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2578~0.base_10|)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2578~0.base_10|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2578~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2578~0.offset=|v_ULTIMATE.start_main_~#t2578~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2578~0.base=|v_ULTIMATE.start_main_~#t2578~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2578~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2578~0.base] because there is no mapped edge [2019-12-27 08:11:03,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L816-1-->L818: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2579~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2579~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2579~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2579~0.base_11|) |v_ULTIMATE.start_main_~#t2579~0.offset_10| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t2579~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t2579~0.base_11| 0)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2579~0.base_11|) 0) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2579~0.base_11| 1) |v_#valid_36|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2579~0.base=|v_ULTIMATE.start_main_~#t2579~0.base_11|, ULTIMATE.start_main_~#t2579~0.offset=|v_ULTIMATE.start_main_~#t2579~0.offset_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2579~0.base, ULTIMATE.start_main_~#t2579~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 08:11:03,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= 1 v_~y$w_buff0~0_14) (= v_~y$w_buff1_used~0_40 v_~y$w_buff0_used~0_67) (= v_~y$w_buff0~0_15 v_~y$w_buff1~0_13) (= 1 v_~y$w_buff0_used~0_66) (= 1 |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|) (= 0 (mod v_~y$w_buff1_used~0_40 256)) (= v_P2Thread1of1ForFork2_~arg.base_4 |v_P2Thread1of1ForFork2_#in~arg.base_4|) (= |v_P2Thread1of1ForFork2_#in~arg.offset_4| v_P2Thread1of1ForFork2_~arg.offset_4) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_4| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$w_buff0~0=v_~y$w_buff0~0_15, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_4|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_66, ~y$w_buff1~0=v_~y$w_buff1~0_13, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_4, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_4, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|, ~y$w_buff0~0=v_~y$w_buff0~0_14, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_4|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_40} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 08:11:03,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] P0ENTRY-->P0EXIT: Formula: (and (= 2 v_~z~0_9) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_6) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~x~0=v_~x~0_6} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z~0=v_~z~0_9, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, ~x~0=v_~x~0_6, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 08:11:03,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L756-->L756-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1577734812 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite8_In1577734812| |P1Thread1of1ForFork1_#t~ite8_Out1577734812|) (= ~y$w_buff0~0_In1577734812 |P1Thread1of1ForFork1_#t~ite9_Out1577734812|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite8_Out1577734812| |P1Thread1of1ForFork1_#t~ite9_Out1577734812|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1577734812 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1577734812 256)) .cse1) (= (mod ~y$w_buff0_used~0_In1577734812 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1577734812 256) 0)))) (= ~y$w_buff0~0_In1577734812 |P1Thread1of1ForFork1_#t~ite8_Out1577734812|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1577734812, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1577734812, ~y$w_buff0~0=~y$w_buff0~0_In1577734812, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1577734812, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In1577734812|, ~weak$$choice2~0=~weak$$choice2~0_In1577734812, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1577734812} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1577734812, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1577734812, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1577734812|, ~y$w_buff0~0=~y$w_buff0~0_In1577734812, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1577734812, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out1577734812|, ~weak$$choice2~0=~weak$$choice2~0_In1577734812, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1577734812} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 08:11:03,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] L758-->L758-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1667457420 256) 0))) (or (and (not .cse0) (= ~y$w_buff0_used~0_In-1667457420 |P1Thread1of1ForFork1_#t~ite15_Out-1667457420|) (= |P1Thread1of1ForFork1_#t~ite14_In-1667457420| |P1Thread1of1ForFork1_#t~ite14_Out-1667457420|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1667457420 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1667457420 256))) (and (= 0 (mod ~y$w_buff1_used~0_In-1667457420 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-1667457420 256) 0))) (= ~y$w_buff0_used~0_In-1667457420 |P1Thread1of1ForFork1_#t~ite14_Out-1667457420|) .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out-1667457420| |P1Thread1of1ForFork1_#t~ite14_Out-1667457420|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1667457420, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1667457420, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1667457420, ~weak$$choice2~0=~weak$$choice2~0_In-1667457420, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1667457420|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1667457420} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1667457420, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1667457420, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1667457420, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1667457420|, ~weak$$choice2~0=~weak$$choice2~0_In-1667457420, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1667457420|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1667457420} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 08:11:03,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~y$r_buff0_thd2~0_43 v_~y$r_buff0_thd2~0_42)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_43, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_10|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_11|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_42, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 08:11:03,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In639805519 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In639805519 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out639805519| ~y$w_buff0_used~0_In639805519)) (and (= 0 |P2Thread1of1ForFork2_#t~ite28_Out639805519|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In639805519, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In639805519} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In639805519, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In639805519, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out639805519|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 08:11:03,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->L771: Formula: (and (= v_~y~0_16 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_16, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 08:11:03,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In18185722 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In18185722 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In18185722 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In18185722 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite29_Out18185722| 0)) (and (= |P2Thread1of1ForFork2_#t~ite29_Out18185722| ~y$w_buff1_used~0_In18185722) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In18185722, ~y$w_buff0_used~0=~y$w_buff0_used~0_In18185722, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In18185722, ~y$w_buff1_used~0=~y$w_buff1_used~0_In18185722} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In18185722, ~y$w_buff0_used~0=~y$w_buff0_used~0_In18185722, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In18185722, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out18185722|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In18185722} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 08:11:03,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In258609134 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In258609134 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In258609134 ~y$r_buff0_thd3~0_Out258609134)) (and (= 0 ~y$r_buff0_thd3~0_Out258609134) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In258609134, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In258609134} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In258609134, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out258609134|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out258609134} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 08:11:03,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1002919002 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd3~0_In1002919002 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In1002919002 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1002919002 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In1002919002 |P2Thread1of1ForFork2_#t~ite31_Out1002919002|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out1002919002|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1002919002, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1002919002, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1002919002, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1002919002} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1002919002, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1002919002, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out1002919002|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1002919002, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1002919002} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 08:11:03,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L795-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite31_8| v_~y$r_buff1_thd3~0_13) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 08:11:03,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~y$w_buff0_used~0_72 256) 0) (= (mod v_~y$r_buff0_thd0~0_15 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_72, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_72, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 08:11:03,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1629352488 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1629352488 256) 0))) (or (and (= ~y~0_In-1629352488 |ULTIMATE.start_main_#t~ite35_Out-1629352488|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite35_Out-1629352488| ~y$w_buff1~0_In-1629352488) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1629352488, ~y~0=~y~0_In-1629352488, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1629352488, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1629352488} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1629352488, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1629352488|, ~y~0=~y~0_In-1629352488, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1629352488, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1629352488} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-27 08:11:03,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_13 |v_ULTIMATE.start_main_#t~ite35_8|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_8|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|, ~y~0=v_~y~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-27 08:11:03,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1583610244 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1583610244 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-1583610244|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1583610244 |ULTIMATE.start_main_#t~ite37_Out-1583610244|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1583610244, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1583610244} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1583610244, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1583610244, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1583610244|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 08:11:03,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-1135808048 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1135808048 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1135808048 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1135808048 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite38_Out-1135808048|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-1135808048 |ULTIMATE.start_main_#t~ite38_Out-1135808048|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1135808048, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1135808048, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1135808048, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1135808048} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1135808048, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1135808048, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1135808048|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1135808048, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1135808048} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 08:11:03,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-61502870 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-61502870 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-61502870| ~y$r_buff0_thd0~0_In-61502870) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-61502870| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-61502870, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-61502870} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-61502870, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-61502870|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-61502870} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 08:11:03,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1173713151 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1173713151 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1173713151 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1173713151 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite40_Out1173713151| ~y$r_buff1_thd0~0_In1173713151)) (and (= |ULTIMATE.start_main_#t~ite40_Out1173713151| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1173713151, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1173713151, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1173713151, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1173713151} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1173713151|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1173713151, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1173713151, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1173713151, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1173713151} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 08:11:03,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~z~0_11 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= |v_ULTIMATE.start_main_#t~ite40_13| v_~y$r_buff1_thd0~0_16) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z~0=v_~z~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z~0=v_~z~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 08:11:03,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:11:03 BasicIcfg [2019-12-27 08:11:03,619 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 08:11:03,621 INFO L168 Benchmark]: Toolchain (without parser) took 17795.32 ms. Allocated memory was 139.5 MB in the beginning and 993.0 MB in the end (delta: 853.5 MB). Free memory was 102.8 MB in the beginning and 571.5 MB in the end (delta: -468.8 MB). Peak memory consumption was 384.8 MB. Max. memory is 7.1 GB. [2019-12-27 08:11:03,622 INFO L168 Benchmark]: CDTParser took 1.43 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 08:11:03,623 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.03 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 102.6 MB in the beginning and 157.5 MB in the end (delta: -54.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-27 08:11:03,624 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.44 ms. Allocated memory is still 203.4 MB. Free memory was 157.5 MB in the beginning and 154.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 08:11:03,624 INFO L168 Benchmark]: Boogie Preprocessor took 43.52 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 152.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 08:11:03,625 INFO L168 Benchmark]: RCFGBuilder took 760.77 ms. Allocated memory is still 203.4 MB. Free memory was 152.9 MB in the beginning and 109.8 MB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 7.1 GB. [2019-12-27 08:11:03,626 INFO L168 Benchmark]: TraceAbstraction took 16207.91 ms. Allocated memory was 203.4 MB in the beginning and 993.0 MB in the end (delta: 789.6 MB). Free memory was 109.2 MB in the beginning and 571.5 MB in the end (delta: -462.4 MB). Peak memory consumption was 327.2 MB. Max. memory is 7.1 GB. [2019-12-27 08:11:03,629 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.43 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 706.03 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 102.6 MB in the beginning and 157.5 MB in the end (delta: -54.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.44 ms. Allocated memory is still 203.4 MB. Free memory was 157.5 MB in the beginning and 154.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.52 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 152.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 760.77 ms. Allocated memory is still 203.4 MB. Free memory was 152.9 MB in the beginning and 109.8 MB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16207.91 ms. Allocated memory was 203.4 MB in the beginning and 993.0 MB in the end (delta: 789.6 MB). Free memory was 109.2 MB in the beginning and 571.5 MB in the end (delta: -462.4 MB). Peak memory consumption was 327.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 151 ProgramPointsBefore, 74 ProgramPointsAfterwards, 176 TransitionsBefore, 83 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 20 ChoiceCompositions, 4568 VarBasedMoverChecksPositive, 135 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48572 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1362 SDtfs, 1587 SDslu, 2418 SDs, 0 SdLazy, 894 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21030occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 8612 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 21772 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...