/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:11:07,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:11:07,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:11:07,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:11:07,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:11:07,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:11:07,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:11:07,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:11:07,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:11:07,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:11:07,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:11:07,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:11:07,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:11:07,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:11:07,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:11:07,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:11:07,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:11:07,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:11:07,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:11:07,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:11:07,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:11:07,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:11:07,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:11:07,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:11:07,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:11:07,376 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:11:07,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:11:07,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:11:07,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:11:07,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:11:07,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:11:07,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:11:07,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:11:07,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:11:07,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:11:07,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:11:07,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:11:07,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:11:07,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:11:07,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:11:07,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:11:07,385 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:11:07,408 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:11:07,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:11:07,411 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:11:07,412 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:11:07,412 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:11:07,412 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:11:07,412 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:11:07,412 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:11:07,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:11:07,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:11:07,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:11:07,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:11:07,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:11:07,415 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:11:07,415 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:11:07,415 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:11:07,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:11:07,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:11:07,416 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:11:07,416 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:11:07,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:11:07,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:11:07,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:11:07,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:11:07,418 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:11:07,418 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:11:07,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:11:07,418 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:11:07,418 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:11:07,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:11:07,765 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:11:07,768 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:11:07,770 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:11:07,770 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:11:07,771 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_rmo.oepc.i [2019-12-27 03:11:07,831 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/028550ed7/5eb017f77e6a410eba2a99648bb6117c/FLAG2d0a7080b [2019-12-27 03:11:08,414 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:11:08,414 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_rmo.oepc.i [2019-12-27 03:11:08,428 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/028550ed7/5eb017f77e6a410eba2a99648bb6117c/FLAG2d0a7080b [2019-12-27 03:11:08,697 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/028550ed7/5eb017f77e6a410eba2a99648bb6117c [2019-12-27 03:11:08,706 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:11:08,707 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:11:08,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:11:08,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:11:08,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:11:08,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:11:08" (1/1) ... [2019-12-27 03:11:08,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@113399e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:08, skipping insertion in model container [2019-12-27 03:11:08,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:11:08" (1/1) ... [2019-12-27 03:11:08,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:11:08,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:11:09,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:11:09,299 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:11:09,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:11:09,479 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:11:09,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:09 WrapperNode [2019-12-27 03:11:09,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:11:09,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:11:09,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:11:09,482 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:11:09,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:09" (1/1) ... [2019-12-27 03:11:09,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:09" (1/1) ... [2019-12-27 03:11:09,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:11:09,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:11:09,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:11:09,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:11:09,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:09" (1/1) ... [2019-12-27 03:11:09,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:09" (1/1) ... [2019-12-27 03:11:09,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:09" (1/1) ... [2019-12-27 03:11:09,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:09" (1/1) ... [2019-12-27 03:11:09,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:09" (1/1) ... [2019-12-27 03:11:09,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:09" (1/1) ... [2019-12-27 03:11:09,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:09" (1/1) ... [2019-12-27 03:11:09,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:11:09,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:11:09,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:11:09,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:11:09,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:09" (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 03:11:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:11:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:11:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:11:09,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:11:09,666 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:11:09,666 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:11:09,667 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:11:09,667 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:11:09,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:11:09,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:11:09,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:11:09,669 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 03:11:10,341 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:11:10,342 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:11:10,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:11:10 BoogieIcfgContainer [2019-12-27 03:11:10,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:11:10,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:11:10,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:11:10,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:11:10,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:11:08" (1/3) ... [2019-12-27 03:11:10,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5410a0b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:11:10, skipping insertion in model container [2019-12-27 03:11:10,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:09" (2/3) ... [2019-12-27 03:11:10,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5410a0b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:11:10, skipping insertion in model container [2019-12-27 03:11:10,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:11:10" (3/3) ... [2019-12-27 03:11:10,353 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_rmo.oepc.i [2019-12-27 03:11:10,363 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:11:10,364 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:11:10,372 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:11:10,373 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:11:10,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,414 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,415 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,443 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,443 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,443 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,444 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,444 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,456 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,456 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,457 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,463 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,464 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:10,484 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 03:11:10,502 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:11:10,502 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:11:10,503 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:11:10,503 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:11:10,503 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:11:10,503 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:11:10,503 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:11:10,503 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:11:10,535 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 164 transitions [2019-12-27 03:11:10,537 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-27 03:11:10,633 INFO L132 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-27 03:11:10,633 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:11:10,650 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 0/125 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 03:11:10,666 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-27 03:11:10,745 INFO L132 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-27 03:11:10,745 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:11:10,752 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 0/125 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 03:11:10,768 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 03:11:10,769 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:11:15,411 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 03:11:15,539 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39492 [2019-12-27 03:11:15,539 INFO L214 etLargeBlockEncoding]: Total number of compositions: 102 [2019-12-27 03:11:15,542 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 75 transitions [2019-12-27 03:11:15,844 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6150 states. [2019-12-27 03:11:15,847 INFO L276 IsEmpty]: Start isEmpty. Operand 6150 states. [2019-12-27 03:11:15,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 03:11:15,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:15,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 03:11:15,856 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:15,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:15,862 INFO L82 PathProgramCache]: Analyzing trace with hash 681495893, now seen corresponding path program 1 times [2019-12-27 03:11:15,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:15,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481718203] [2019-12-27 03:11:15,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:16,110 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 03:11:16,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481718203] [2019-12-27 03:11:16,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:16,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:11:16,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728547992] [2019-12-27 03:11:16,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:11:16,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:16,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:11:16,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:11:16,134 INFO L87 Difference]: Start difference. First operand 6150 states. Second operand 3 states. [2019-12-27 03:11:16,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:16,345 INFO L93 Difference]: Finished difference Result 5990 states and 20128 transitions. [2019-12-27 03:11:16,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:11:16,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 03:11:16,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:16,461 INFO L225 Difference]: With dead ends: 5990 [2019-12-27 03:11:16,461 INFO L226 Difference]: Without dead ends: 5642 [2019-12-27 03:11:16,464 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 03:11:16,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2019-12-27 03:11:16,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5642. [2019-12-27 03:11:16,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2019-12-27 03:11:16,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 18923 transitions. [2019-12-27 03:11:16,799 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 18923 transitions. Word has length 5 [2019-12-27 03:11:16,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:16,799 INFO L462 AbstractCegarLoop]: Abstraction has 5642 states and 18923 transitions. [2019-12-27 03:11:16,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:11:16,800 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 18923 transitions. [2019-12-27 03:11:16,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:11:16,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:16,803 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:11:16,803 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:16,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:16,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1994037290, now seen corresponding path program 1 times [2019-12-27 03:11:16,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:16,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788416583] [2019-12-27 03:11:16,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:11:16,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788416583] [2019-12-27 03:11:16,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:16,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:11:16,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77720421] [2019-12-27 03:11:16,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:11:16,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:16,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:11:16,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:11:16,869 INFO L87 Difference]: Start difference. First operand 5642 states and 18923 transitions. Second operand 3 states. [2019-12-27 03:11:16,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:16,918 INFO L93 Difference]: Finished difference Result 1157 states and 2862 transitions. [2019-12-27 03:11:16,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:11:16,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 03:11:16,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:16,927 INFO L225 Difference]: With dead ends: 1157 [2019-12-27 03:11:16,928 INFO L226 Difference]: Without dead ends: 1157 [2019-12-27 03:11:16,930 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 03:11:16,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2019-12-27 03:11:16,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1157. [2019-12-27 03:11:16,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2019-12-27 03:11:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 2862 transitions. [2019-12-27 03:11:16,967 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 2862 transitions. Word has length 11 [2019-12-27 03:11:16,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:16,968 INFO L462 AbstractCegarLoop]: Abstraction has 1157 states and 2862 transitions. [2019-12-27 03:11:16,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:11:16,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 2862 transitions. [2019-12-27 03:11:16,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:11:16,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:16,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:11:16,976 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:16,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:16,976 INFO L82 PathProgramCache]: Analyzing trace with hash 638913215, now seen corresponding path program 1 times [2019-12-27 03:11:16,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:16,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794973047] [2019-12-27 03:11:16,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:17,115 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 03:11:17,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794973047] [2019-12-27 03:11:17,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:17,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:11:17,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947325303] [2019-12-27 03:11:17,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:11:17,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:17,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:11:17,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:11:17,117 INFO L87 Difference]: Start difference. First operand 1157 states and 2862 transitions. Second operand 3 states. [2019-12-27 03:11:17,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:17,203 INFO L93 Difference]: Finished difference Result 1787 states and 4461 transitions. [2019-12-27 03:11:17,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:11:17,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 03:11:17,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:17,214 INFO L225 Difference]: With dead ends: 1787 [2019-12-27 03:11:17,214 INFO L226 Difference]: Without dead ends: 1787 [2019-12-27 03:11:17,214 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 03:11:17,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2019-12-27 03:11:17,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1271. [2019-12-27 03:11:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2019-12-27 03:11:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 3173 transitions. [2019-12-27 03:11:17,264 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 3173 transitions. Word has length 14 [2019-12-27 03:11:17,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:17,265 INFO L462 AbstractCegarLoop]: Abstraction has 1271 states and 3173 transitions. [2019-12-27 03:11:17,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:11:17,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 3173 transitions. [2019-12-27 03:11:17,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:11:17,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:17,267 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:11:17,267 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:17,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:17,268 INFO L82 PathProgramCache]: Analyzing trace with hash 775445368, now seen corresponding path program 1 times [2019-12-27 03:11:17,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:17,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007547141] [2019-12-27 03:11:17,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:17,409 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 03:11:17,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007547141] [2019-12-27 03:11:17,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:17,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:11:17,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674818715] [2019-12-27 03:11:17,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:11:17,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:17,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:11:17,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:11:17,412 INFO L87 Difference]: Start difference. First operand 1271 states and 3173 transitions. Second operand 4 states. [2019-12-27 03:11:17,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:17,639 INFO L93 Difference]: Finished difference Result 1720 states and 4173 transitions. [2019-12-27 03:11:17,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:11:17,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:11:17,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:17,649 INFO L225 Difference]: With dead ends: 1720 [2019-12-27 03:11:17,649 INFO L226 Difference]: Without dead ends: 1720 [2019-12-27 03:11:17,650 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 03:11:17,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2019-12-27 03:11:17,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1552. [2019-12-27 03:11:17,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2019-12-27 03:11:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 3797 transitions. [2019-12-27 03:11:17,689 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 3797 transitions. Word has length 14 [2019-12-27 03:11:17,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:17,690 INFO L462 AbstractCegarLoop]: Abstraction has 1552 states and 3797 transitions. [2019-12-27 03:11:17,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:11:17,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 3797 transitions. [2019-12-27 03:11:17,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:11:17,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:17,691 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:11:17,691 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:17,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:17,691 INFO L82 PathProgramCache]: Analyzing trace with hash -289899718, now seen corresponding path program 1 times [2019-12-27 03:11:17,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:17,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361109473] [2019-12-27 03:11:17,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:17,786 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 03:11:17,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361109473] [2019-12-27 03:11:17,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:17,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:11:17,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105278335] [2019-12-27 03:11:17,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:11:17,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:17,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:11:17,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:11:17,788 INFO L87 Difference]: Start difference. First operand 1552 states and 3797 transitions. Second operand 4 states. [2019-12-27 03:11:17,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:17,931 INFO L93 Difference]: Finished difference Result 1981 states and 4771 transitions. [2019-12-27 03:11:17,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:11:17,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:11:17,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:17,943 INFO L225 Difference]: With dead ends: 1981 [2019-12-27 03:11:17,943 INFO L226 Difference]: Without dead ends: 1981 [2019-12-27 03:11:17,944 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 03:11:17,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-12-27 03:11:17,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1581. [2019-12-27 03:11:17,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2019-12-27 03:11:17,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 3869 transitions. [2019-12-27 03:11:17,984 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 3869 transitions. Word has length 14 [2019-12-27 03:11:17,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:17,985 INFO L462 AbstractCegarLoop]: Abstraction has 1581 states and 3869 transitions. [2019-12-27 03:11:17,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:11:17,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 3869 transitions. [2019-12-27 03:11:17,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 03:11:17,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:17,988 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:11:17,988 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:17,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:17,988 INFO L82 PathProgramCache]: Analyzing trace with hash -719161205, now seen corresponding path program 1 times [2019-12-27 03:11:17,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:17,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234482559] [2019-12-27 03:11:17,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:18,033 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 03:11:18,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234482559] [2019-12-27 03:11:18,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:18,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:11:18,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281770521] [2019-12-27 03:11:18,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:11:18,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:18,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:11:18,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:11:18,035 INFO L87 Difference]: Start difference. First operand 1581 states and 3869 transitions. Second operand 4 states. [2019-12-27 03:11:18,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:18,052 INFO L93 Difference]: Finished difference Result 702 states and 1600 transitions. [2019-12-27 03:11:18,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:11:18,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-27 03:11:18,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:18,056 INFO L225 Difference]: With dead ends: 702 [2019-12-27 03:11:18,056 INFO L226 Difference]: Without dead ends: 702 [2019-12-27 03:11:18,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:11:18,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-12-27 03:11:18,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 670. [2019-12-27 03:11:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-27 03:11:18,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1532 transitions. [2019-12-27 03:11:18,071 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1532 transitions. Word has length 26 [2019-12-27 03:11:18,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:18,072 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1532 transitions. [2019-12-27 03:11:18,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:11:18,072 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1532 transitions. [2019-12-27 03:11:18,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 03:11:18,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:18,074 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] [2019-12-27 03:11:18,074 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:18,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:18,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1430443939, now seen corresponding path program 1 times [2019-12-27 03:11:18,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:18,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044395145] [2019-12-27 03:11:18,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:18,164 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 03:11:18,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044395145] [2019-12-27 03:11:18,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:18,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:11:18,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987383589] [2019-12-27 03:11:18,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:11:18,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:18,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:11:18,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:11:18,166 INFO L87 Difference]: Start difference. First operand 670 states and 1532 transitions. Second operand 6 states. [2019-12-27 03:11:18,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:18,379 INFO L93 Difference]: Finished difference Result 1768 states and 3997 transitions. [2019-12-27 03:11:18,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:11:18,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 03:11:18,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:18,386 INFO L225 Difference]: With dead ends: 1768 [2019-12-27 03:11:18,387 INFO L226 Difference]: Without dead ends: 1174 [2019-12-27 03:11:18,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:11:18,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2019-12-27 03:11:18,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 749. [2019-12-27 03:11:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-12-27 03:11:18,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1716 transitions. [2019-12-27 03:11:18,407 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1716 transitions. Word has length 41 [2019-12-27 03:11:18,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:18,408 INFO L462 AbstractCegarLoop]: Abstraction has 749 states and 1716 transitions. [2019-12-27 03:11:18,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:11:18,409 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1716 transitions. [2019-12-27 03:11:18,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 03:11:18,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:18,411 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] [2019-12-27 03:11:18,411 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:18,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:18,412 INFO L82 PathProgramCache]: Analyzing trace with hash -367672255, now seen corresponding path program 2 times [2019-12-27 03:11:18,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:18,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688334253] [2019-12-27 03:11:18,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:18,463 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 03:11:18,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688334253] [2019-12-27 03:11:18,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:18,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:11:18,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025551275] [2019-12-27 03:11:18,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:11:18,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:18,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:11:18,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:11:18,466 INFO L87 Difference]: Start difference. First operand 749 states and 1716 transitions. Second operand 3 states. [2019-12-27 03:11:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:18,476 INFO L93 Difference]: Finished difference Result 1153 states and 2657 transitions. [2019-12-27 03:11:18,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:11:18,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 03:11:18,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:18,479 INFO L225 Difference]: With dead ends: 1153 [2019-12-27 03:11:18,479 INFO L226 Difference]: Without dead ends: 424 [2019-12-27 03:11:18,480 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 03:11:18,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-12-27 03:11:18,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2019-12-27 03:11:18,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-12-27 03:11:18,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 974 transitions. [2019-12-27 03:11:18,489 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 974 transitions. Word has length 41 [2019-12-27 03:11:18,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:18,490 INFO L462 AbstractCegarLoop]: Abstraction has 424 states and 974 transitions. [2019-12-27 03:11:18,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:11:18,490 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 974 transitions. [2019-12-27 03:11:18,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 03:11:18,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:18,491 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] [2019-12-27 03:11:18,491 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:18,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:18,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1769242661, now seen corresponding path program 3 times [2019-12-27 03:11:18,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:18,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725834840] [2019-12-27 03:11:18,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:18,591 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 03:11:18,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725834840] [2019-12-27 03:11:18,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:18,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:11:18,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445729384] [2019-12-27 03:11:18,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:11:18,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:18,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:11:18,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:11:18,594 INFO L87 Difference]: Start difference. First operand 424 states and 974 transitions. Second operand 3 states. [2019-12-27 03:11:18,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:18,606 INFO L93 Difference]: Finished difference Result 422 states and 969 transitions. [2019-12-27 03:11:18,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:11:18,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 03:11:18,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:18,611 INFO L225 Difference]: With dead ends: 422 [2019-12-27 03:11:18,611 INFO L226 Difference]: Without dead ends: 422 [2019-12-27 03:11:18,612 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 03:11:18,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-12-27 03:11:18,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2019-12-27 03:11:18,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-12-27 03:11:18,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 969 transitions. [2019-12-27 03:11:18,622 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 969 transitions. Word has length 41 [2019-12-27 03:11:18,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:18,624 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 969 transitions. [2019-12-27 03:11:18,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:11:18,624 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 969 transitions. [2019-12-27 03:11:18,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 03:11:18,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:18,626 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] [2019-12-27 03:11:18,626 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:18,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:18,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1127216463, now seen corresponding path program 1 times [2019-12-27 03:11:18,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:18,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494232446] [2019-12-27 03:11:18,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:11:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:11:18,799 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:11:18,799 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:11:18,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$w_buff1_used~0_374) (= v_~__unbuffered_p1_EBX~0_96 0) (= v_~x$r_buff0_thd1~0_280 0) (= 0 v_~x~0_123) (= v_~x$flush_delayed~0_46 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1641~0.base_35| 4)) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff0_used~0_610) (= v_~x$r_buff0_thd0~0_130 0) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1641~0.base_35|)) (= v_~weak$$choice2~0_130 0) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1641~0.base_35|) (= 0 v_~x$read_delayed_var~0.base_7) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1641~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1641~0.base_35|) |v_ULTIMATE.start_main_~#t1641~0.offset_24| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p0_EAX~0_68) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_6|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1641~0.base_35| 1) |v_#valid_59|) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_15 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~x$r_buff0_thd2~0_177) (= 0 v_~__unbuffered_p1_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_91) (= v_~x$r_buff1_thd1~0_230 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_ULTIMATE.start_main_~#t1641~0.offset_24| 0) (= 0 v_~weak$$choice0~0_13) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ULTIMATE.start_main_~#t1641~0.offset=|v_ULTIMATE.start_main_~#t1641~0.offset_24|, ULTIMATE.start_main_~#t1642~0.base=|v_ULTIMATE.start_main_~#t1642~0.base_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, #length=|v_#length_17|, ~y~0=v_~y~0_101, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_~#t1641~0.base=|v_ULTIMATE.start_main_~#t1641~0.base_35|, ULTIMATE.start_main_~#t1642~0.offset=|v_ULTIMATE.start_main_~#t1642~0.offset_24|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_87|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_123, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1641~0.offset, ULTIMATE.start_main_~#t1642~0.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1641~0.base, ULTIMATE.start_main_~#t1642~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 03:11:18,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1642~0.base_10| 4) |v_#length_9|) (not (= |v_ULTIMATE.start_main_~#t1642~0.base_10| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1642~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1642~0.base_10|) |v_ULTIMATE.start_main_~#t1642~0.offset_9| 1))) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1642~0.base_10| 1)) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1642~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1642~0.base_10|) (= |v_ULTIMATE.start_main_~#t1642~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1642~0.offset=|v_ULTIMATE.start_main_~#t1642~0.offset_9|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1642~0.base=|v_ULTIMATE.start_main_~#t1642~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1642~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1642~0.base] because there is no mapped edge [2019-12-27 03:11:18,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (= ~x$r_buff1_thd1~0_Out-1239562957 ~x$r_buff0_thd1~0_In-1239562957) (= ~x$r_buff1_thd0~0_Out-1239562957 ~x$r_buff0_thd0~0_In-1239562957) (not (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-1239562957 0)) (= 1 ~x$r_buff0_thd2~0_Out-1239562957) (= 1 ~y~0_Out-1239562957) (= ~__unbuffered_p1_EBX~0_Out-1239562957 ~y~0_Out-1239562957) (= ~__unbuffered_p1_EAX~0_Out-1239562957 ~y~0_Out-1239562957) (= ~x$r_buff0_thd2~0_In-1239562957 ~x$r_buff1_thd2~0_Out-1239562957)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1239562957, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1239562957, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-1239562957, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1239562957} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1239562957, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1239562957, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-1239562957, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-1239562957, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-1239562957, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-1239562957, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-1239562957, ~y~0=~y~0_Out-1239562957, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1239562957, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1239562957} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 03:11:18,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 03:11:18,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1961830362 256)))) (or (and (= ~x$r_buff1_thd1~0_In-1961830362 |P0Thread1of1ForFork1_#t~ite24_Out-1961830362|) (= |P0Thread1of1ForFork1_#t~ite23_In-1961830362| |P0Thread1of1ForFork1_#t~ite23_Out-1961830362|) (= |P0Thread1of1ForFork1_#t~ite22_In-1961830362| |P0Thread1of1ForFork1_#t~ite22_Out-1961830362|) (not .cse0)) (let ((.cse1 (not (= (mod ~x$r_buff0_thd1~0_In-1961830362 256) 0)))) (and (= |P0Thread1of1ForFork1_#t~ite22_Out-1961830362| |P0Thread1of1ForFork1_#t~ite23_Out-1961830362|) (= |P0Thread1of1ForFork1_#t~ite24_Out-1961830362| |P0Thread1of1ForFork1_#t~ite23_Out-1961830362|) (not (= 0 (mod ~x$w_buff0_used~0_In-1961830362 256))) .cse0 (or (not (= (mod ~x$w_buff1_used~0_In-1961830362 256) 0)) .cse1) (or .cse1 (not (= (mod ~x$r_buff1_thd1~0_In-1961830362 256) 0))) (= |P0Thread1of1ForFork1_#t~ite22_Out-1961830362| 0))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1961830362, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1961830362, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1961830362, ~weak$$choice2~0=~weak$$choice2~0_In-1961830362, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In-1961830362|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1961830362, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In-1961830362|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1961830362, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1961830362, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1961830362, ~weak$$choice2~0=~weak$$choice2~0_In-1961830362, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out-1961830362|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out-1961830362|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out-1961830362|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1961830362} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 03:11:18,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x$mem_tmp~0_6 v_~x~0_38) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 03:11:18,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1012398192 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1012398192 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1012398192|)) (and (= ~x$w_buff0_used~0_In1012398192 |P1Thread1of1ForFork0_#t~ite28_Out1012398192|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1012398192, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1012398192} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1012398192, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1012398192|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1012398192} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 03:11:18,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In895751543 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In895751543 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In895751543 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In895751543 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out895751543| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite29_Out895751543| ~x$w_buff1_used~0_In895751543) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In895751543, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In895751543, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In895751543, ~x$w_buff0_used~0=~x$w_buff0_used~0_In895751543} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In895751543, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In895751543, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In895751543, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out895751543|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In895751543} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 03:11:18,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In695481182 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In695481182 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out695481182 ~x$r_buff0_thd2~0_In695481182)) (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out695481182 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In695481182, ~x$w_buff0_used~0=~x$w_buff0_used~0_In695481182} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out695481182|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out695481182, ~x$w_buff0_used~0=~x$w_buff0_used~0_In695481182} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 03:11:18,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-530616377 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-530616377 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-530616377 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-530616377 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-530616377 |P1Thread1of1ForFork0_#t~ite31_Out-530616377|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-530616377|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-530616377, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-530616377, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-530616377, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-530616377} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-530616377|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-530616377, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-530616377, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-530616377, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-530616377} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 03:11:18,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_57 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 03:11:18,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 2 v_~__unbuffered_cnt~0_12)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:11:18,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-761822829 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-761822829 256) 0))) (or (and (not .cse0) (= ~x$w_buff1~0_In-761822829 |ULTIMATE.start_main_#t~ite34_Out-761822829|) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In-761822829 |ULTIMATE.start_main_#t~ite34_Out-761822829|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-761822829, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-761822829, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-761822829, ~x~0=~x~0_In-761822829} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-761822829, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-761822829, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-761822829, ~x~0=~x~0_In-761822829, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-761822829|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 03:11:18,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 03:11:18,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In2144380475 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In2144380475 256)))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out2144380475| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out2144380475| ~x$w_buff0_used~0_In2144380475) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2144380475, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2144380475} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2144380475, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out2144380475|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2144380475} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 03:11:18,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-2062158591 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-2062158591 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2062158591 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-2062158591 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-2062158591 |ULTIMATE.start_main_#t~ite37_Out-2062158591|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-2062158591|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2062158591, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2062158591, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2062158591, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2062158591} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2062158591, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2062158591, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-2062158591|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2062158591, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2062158591} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 03:11:18,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-540235684 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-540235684 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-540235684|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-540235684 |ULTIMATE.start_main_#t~ite38_Out-540235684|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-540235684, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-540235684} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-540235684, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-540235684|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-540235684} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 03:11:18,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-1298642894 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-1298642894 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1298642894 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1298642894 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In-1298642894 |ULTIMATE.start_main_#t~ite39_Out-1298642894|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite39_Out-1298642894| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1298642894, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1298642894, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1298642894, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1298642894} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1298642894, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1298642894|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1298642894, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1298642894, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1298642894} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 03:11:18,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y~0_42 2) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_40 1) (= v_~x$r_buff1_thd0~0_72 |v_ULTIMATE.start_main_#t~ite39_40|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_40|, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:11:18,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:11:18 BasicIcfg [2019-12-27 03:11:18,934 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:11:18,936 INFO L168 Benchmark]: Toolchain (without parser) took 10228.62 ms. Allocated memory was 140.5 MB in the beginning and 374.9 MB in the end (delta: 234.4 MB). Free memory was 100.7 MB in the beginning and 328.6 MB in the end (delta: -227.9 MB). Peak memory consumption was 224.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:11:18,936 INFO L168 Benchmark]: CDTParser took 0.78 ms. Allocated memory is still 140.5 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 03:11:18,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.04 ms. Allocated memory was 140.5 MB in the beginning and 200.8 MB in the end (delta: 60.3 MB). Free memory was 100.5 MB in the beginning and 155.3 MB in the end (delta: -54.8 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:11:18,938 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.92 ms. Allocated memory is still 200.8 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:11:18,939 INFO L168 Benchmark]: Boogie Preprocessor took 42.44 ms. Allocated memory is still 200.8 MB. Free memory was 152.6 MB in the beginning and 149.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:11:18,940 INFO L168 Benchmark]: RCFGBuilder took 734.03 ms. Allocated memory is still 200.8 MB. Free memory was 149.9 MB in the beginning and 108.7 MB in the end (delta: 41.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. [2019-12-27 03:11:18,940 INFO L168 Benchmark]: TraceAbstraction took 8589.57 ms. Allocated memory was 200.8 MB in the beginning and 374.9 MB in the end (delta: 174.1 MB). Free memory was 108.7 MB in the beginning and 328.6 MB in the end (delta: -219.9 MB). Peak memory consumption was 172.2 MB. Max. memory is 7.1 GB. [2019-12-27 03:11:18,945 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.78 ms. Allocated memory is still 140.5 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 773.04 ms. Allocated memory was 140.5 MB in the beginning and 200.8 MB in the end (delta: 60.3 MB). Free memory was 100.5 MB in the beginning and 155.3 MB in the end (delta: -54.8 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.92 ms. Allocated memory is still 200.8 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.44 ms. Allocated memory is still 200.8 MB. Free memory was 152.6 MB in the beginning and 149.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 734.03 ms. Allocated memory is still 200.8 MB. Free memory was 149.9 MB in the beginning and 108.7 MB in the end (delta: 41.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8589.57 ms. Allocated memory was 200.8 MB in the beginning and 374.9 MB in the end (delta: 174.1 MB). Free memory was 108.7 MB in the beginning and 328.6 MB in the end (delta: -219.9 MB). Peak memory consumption was 172.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 136 ProgramPointsBefore, 65 ProgramPointsAfterwards, 164 TransitionsBefore, 75 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 21 ChoiceCompositions, 4335 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 167 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 39492 CheckedPairsTotal, 102 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1641, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] FCALL, FORK 0 pthread_create(&t1642, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 130 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.2s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 942 SDtfs, 634 SDslu, 1263 SDs, 0 SdLazy, 453 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6150occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 1541 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 15702 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...