/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/rfi008_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:15:50,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:15:50,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:15:50,351 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:15:50,351 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:15:50,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:15:50,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:15:50,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:15:50,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:15:50,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:15:50,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:15:50,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:15:50,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:15:50,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:15:50,362 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:15:50,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:15:50,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:15:50,364 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:15:50,366 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:15:50,368 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:15:50,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:15:50,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:15:50,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:15:50,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:15:50,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:15:50,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:15:50,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:15:50,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:15:50,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:15:50,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:15:50,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:15:50,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:15:50,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:15:50,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:15:50,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:15:50,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:15:50,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:15:50,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:15:50,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:15:50,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:15:50,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:15:50,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:15:50,409 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:15:50,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:15:50,411 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:15:50,411 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:15:50,411 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:15:50,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:15:50,411 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:15:50,412 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:15:50,412 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:15:50,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:15:50,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:15:50,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:15:50,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:15:50,413 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:15:50,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:15:50,413 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:15:50,413 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:15:50,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:15:50,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:15:50,414 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:15:50,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:15:50,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:15:50,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:15:50,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:15:50,415 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:15:50,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:15:50,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:15:50,416 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:15:50,416 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:15:50,671 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:15:50,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:15:50,692 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:15:50,693 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:15:50,694 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:15:50,695 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008_pso.oepc.i [2019-12-27 03:15:50,768 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a461d101/cadbf10141dc425a9a13d9ff49ebee40/FLAG528901bae [2019-12-27 03:15:51,312 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:15:51,313 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008_pso.oepc.i [2019-12-27 03:15:51,326 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a461d101/cadbf10141dc425a9a13d9ff49ebee40/FLAG528901bae [2019-12-27 03:15:51,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a461d101/cadbf10141dc425a9a13d9ff49ebee40 [2019-12-27 03:15:51,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:15:51,571 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:15:51,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:15:51,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:15:51,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:15:51,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:15:51" (1/1) ... [2019-12-27 03:15:51,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3a9b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:51, skipping insertion in model container [2019-12-27 03:15:51,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:15:51" (1/1) ... [2019-12-27 03:15:51,587 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:15:51,640 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:15:52,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:15:52,202 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:15:52,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:15:52,339 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:15:52,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:52 WrapperNode [2019-12-27 03:15:52,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:15:52,342 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:15:52,342 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:15:52,342 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:15:52,349 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:15:52" (1/1) ... [2019-12-27 03:15:52,368 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:15:52" (1/1) ... [2019-12-27 03:15:52,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:15:52,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:15:52,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:15:52,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:15:52,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:52" (1/1) ... [2019-12-27 03:15:52,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:52" (1/1) ... [2019-12-27 03:15:52,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:52" (1/1) ... [2019-12-27 03:15:52,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:52" (1/1) ... [2019-12-27 03:15:52,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:52" (1/1) ... [2019-12-27 03:15:52,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:52" (1/1) ... [2019-12-27 03:15:52,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:52" (1/1) ... [2019-12-27 03:15:52,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:15:52,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:15:52,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:15:52,445 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:15:52,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:52" (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:15:52,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:15:52,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:15:52,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:15:52,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:15:52,526 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:15:52,527 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:15:52,527 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:15:52,527 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:15:52,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:15:52,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:15:52,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:15:52,530 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:15:53,501 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:15:53,501 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:15:53,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:15:53 BoogieIcfgContainer [2019-12-27 03:15:53,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:15:53,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:15:53,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:15:53,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:15:53,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:15:51" (1/3) ... [2019-12-27 03:15:53,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce777a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:15:53, skipping insertion in model container [2019-12-27 03:15:53,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:52" (2/3) ... [2019-12-27 03:15:53,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce777a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:15:53, skipping insertion in model container [2019-12-27 03:15:53,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:15:53" (3/3) ... [2019-12-27 03:15:53,511 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_pso.oepc.i [2019-12-27 03:15:53,521 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:15:53,521 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:15:53,529 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:15:53,530 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:15:53,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,594 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,594 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,594 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,595 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,595 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,621 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,622 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,649 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,651 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,659 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,660 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,664 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:53,689 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 03:15:53,710 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:15:53,710 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:15:53,711 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:15:53,711 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:15:53,711 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:15:53,711 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:15:53,711 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:15:53,711 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:15:53,735 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 246 transitions [2019-12-27 03:15:53,737 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-27 03:15:53,851 INFO L132 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-27 03:15:53,851 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:15:53,868 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 625 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 03:15:53,899 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-27 03:15:53,961 INFO L132 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-27 03:15:53,961 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:15:53,973 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 625 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 03:15:54,009 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 27428 [2019-12-27 03:15:54,010 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:15:59,830 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 03:15:59,947 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 03:16:00,023 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146813 [2019-12-27 03:16:00,023 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 03:16:00,027 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 136 transitions [2019-12-27 03:16:01,990 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 29658 states. [2019-12-27 03:16:01,992 INFO L276 IsEmpty]: Start isEmpty. Operand 29658 states. [2019-12-27 03:16:01,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 03:16:01,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:01,998 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 03:16:01,999 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:02,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:02,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1084682, now seen corresponding path program 1 times [2019-12-27 03:16:02,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:02,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787975876] [2019-12-27 03:16:02,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:02,246 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:16:02,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787975876] [2019-12-27 03:16:02,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:02,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:16:02,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967026690] [2019-12-27 03:16:02,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:16:02,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:02,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:16:02,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:16:02,273 INFO L87 Difference]: Start difference. First operand 29658 states. Second operand 3 states. [2019-12-27 03:16:03,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:03,017 INFO L93 Difference]: Finished difference Result 29506 states and 103746 transitions. [2019-12-27 03:16:03,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:16:03,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 03:16:03,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:03,242 INFO L225 Difference]: With dead ends: 29506 [2019-12-27 03:16:03,243 INFO L226 Difference]: Without dead ends: 27490 [2019-12-27 03:16:03,244 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:16:04,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27490 states. [2019-12-27 03:16:05,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27490 to 27490. [2019-12-27 03:16:05,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27490 states. [2019-12-27 03:16:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27490 states to 27490 states and 96576 transitions. [2019-12-27 03:16:05,818 INFO L78 Accepts]: Start accepts. Automaton has 27490 states and 96576 transitions. Word has length 3 [2019-12-27 03:16:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:05,820 INFO L462 AbstractCegarLoop]: Abstraction has 27490 states and 96576 transitions. [2019-12-27 03:16:05,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:16:05,820 INFO L276 IsEmpty]: Start isEmpty. Operand 27490 states and 96576 transitions. [2019-12-27 03:16:05,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:16:05,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:05,826 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:16:05,827 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:05,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:05,827 INFO L82 PathProgramCache]: Analyzing trace with hash -272589760, now seen corresponding path program 1 times [2019-12-27 03:16:05,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:05,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762086439] [2019-12-27 03:16:05,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:05,946 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:16:05,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762086439] [2019-12-27 03:16:05,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:05,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:16:05,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439312823] [2019-12-27 03:16:05,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:16:05,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:05,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:16:05,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:16:05,950 INFO L87 Difference]: Start difference. First operand 27490 states and 96576 transitions. Second operand 3 states. [2019-12-27 03:16:06,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:06,030 INFO L93 Difference]: Finished difference Result 3269 states and 8037 transitions. [2019-12-27 03:16:06,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:16:06,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 03:16:06,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:06,040 INFO L225 Difference]: With dead ends: 3269 [2019-12-27 03:16:06,041 INFO L226 Difference]: Without dead ends: 3269 [2019-12-27 03:16:06,042 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:16:06,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states. [2019-12-27 03:16:06,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3269. [2019-12-27 03:16:06,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3269 states. [2019-12-27 03:16:06,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 8037 transitions. [2019-12-27 03:16:06,148 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 8037 transitions. Word has length 11 [2019-12-27 03:16:06,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:06,148 INFO L462 AbstractCegarLoop]: Abstraction has 3269 states and 8037 transitions. [2019-12-27 03:16:06,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:16:06,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 8037 transitions. [2019-12-27 03:16:06,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:16:06,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:06,155 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:16:06,156 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:06,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:06,156 INFO L82 PathProgramCache]: Analyzing trace with hash 295368792, now seen corresponding path program 1 times [2019-12-27 03:16:06,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:06,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771967956] [2019-12-27 03:16:06,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:06,276 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:16:06,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771967956] [2019-12-27 03:16:06,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:06,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:16:06,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840031197] [2019-12-27 03:16:06,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:16:06,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:06,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:16:06,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:16:06,280 INFO L87 Difference]: Start difference. First operand 3269 states and 8037 transitions. Second operand 4 states. [2019-12-27 03:16:06,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:06,585 INFO L93 Difference]: Finished difference Result 4313 states and 10392 transitions. [2019-12-27 03:16:06,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:16:06,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:16:06,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:06,598 INFO L225 Difference]: With dead ends: 4313 [2019-12-27 03:16:06,599 INFO L226 Difference]: Without dead ends: 4313 [2019-12-27 03:16:06,599 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:16:06,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2019-12-27 03:16:06,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4245. [2019-12-27 03:16:06,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4245 states. [2019-12-27 03:16:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4245 states to 4245 states and 10260 transitions. [2019-12-27 03:16:06,718 INFO L78 Accepts]: Start accepts. Automaton has 4245 states and 10260 transitions. Word has length 14 [2019-12-27 03:16:06,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:06,719 INFO L462 AbstractCegarLoop]: Abstraction has 4245 states and 10260 transitions. [2019-12-27 03:16:06,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:16:06,720 INFO L276 IsEmpty]: Start isEmpty. Operand 4245 states and 10260 transitions. [2019-12-27 03:16:06,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 03:16:06,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:06,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:16:06,724 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:06,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:06,724 INFO L82 PathProgramCache]: Analyzing trace with hash 566526596, now seen corresponding path program 1 times [2019-12-27 03:16:06,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:06,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646590811] [2019-12-27 03:16:06,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:06,799 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:16:06,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646590811] [2019-12-27 03:16:06,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:06,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:16:06,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192847198] [2019-12-27 03:16:06,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:16:06,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:06,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:16:06,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:16:06,804 INFO L87 Difference]: Start difference. First operand 4245 states and 10260 transitions. Second operand 3 states. [2019-12-27 03:16:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:06,909 INFO L93 Difference]: Finished difference Result 7552 states and 17381 transitions. [2019-12-27 03:16:06,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:16:06,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 03:16:06,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:06,932 INFO L225 Difference]: With dead ends: 7552 [2019-12-27 03:16:06,932 INFO L226 Difference]: Without dead ends: 7552 [2019-12-27 03:16:06,932 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:16:06,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7552 states. [2019-12-27 03:16:07,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7552 to 6526. [2019-12-27 03:16:07,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6526 states. [2019-12-27 03:16:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6526 states to 6526 states and 15257 transitions. [2019-12-27 03:16:07,082 INFO L78 Accepts]: Start accepts. Automaton has 6526 states and 15257 transitions. Word has length 15 [2019-12-27 03:16:07,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:07,082 INFO L462 AbstractCegarLoop]: Abstraction has 6526 states and 15257 transitions. [2019-12-27 03:16:07,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:16:07,082 INFO L276 IsEmpty]: Start isEmpty. Operand 6526 states and 15257 transitions. [2019-12-27 03:16:07,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 03:16:07,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:07,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:16:07,085 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:07,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:07,085 INFO L82 PathProgramCache]: Analyzing trace with hash -759251224, now seen corresponding path program 1 times [2019-12-27 03:16:07,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:07,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107201921] [2019-12-27 03:16:07,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:07,170 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:16:07,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107201921] [2019-12-27 03:16:07,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:07,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:16:07,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231477105] [2019-12-27 03:16:07,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:16:07,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:07,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:16:07,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:16:07,173 INFO L87 Difference]: Start difference. First operand 6526 states and 15257 transitions. Second operand 4 states. [2019-12-27 03:16:07,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:07,591 INFO L93 Difference]: Finished difference Result 7957 states and 18351 transitions. [2019-12-27 03:16:07,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:16:07,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 03:16:07,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:07,604 INFO L225 Difference]: With dead ends: 7957 [2019-12-27 03:16:07,605 INFO L226 Difference]: Without dead ends: 7957 [2019-12-27 03:16:07,605 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:16:07,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7957 states. [2019-12-27 03:16:07,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7957 to 6579. [2019-12-27 03:16:07,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6579 states. [2019-12-27 03:16:07,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6579 states to 6579 states and 15368 transitions. [2019-12-27 03:16:07,737 INFO L78 Accepts]: Start accepts. Automaton has 6579 states and 15368 transitions. Word has length 17 [2019-12-27 03:16:07,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:07,737 INFO L462 AbstractCegarLoop]: Abstraction has 6579 states and 15368 transitions. [2019-12-27 03:16:07,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:16:07,737 INFO L276 IsEmpty]: Start isEmpty. Operand 6579 states and 15368 transitions. [2019-12-27 03:16:07,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 03:16:07,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:07,742 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:16:07,743 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:07,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:07,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1258171186, now seen corresponding path program 1 times [2019-12-27 03:16:07,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:07,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719311058] [2019-12-27 03:16:07,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:07,799 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:16:07,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719311058] [2019-12-27 03:16:07,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:07,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:16:07,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404141311] [2019-12-27 03:16:07,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:16:07,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:07,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:16:07,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:16:07,801 INFO L87 Difference]: Start difference. First operand 6579 states and 15368 transitions. Second operand 5 states. [2019-12-27 03:16:08,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:08,209 INFO L93 Difference]: Finished difference Result 8876 states and 20253 transitions. [2019-12-27 03:16:08,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:16:08,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 03:16:08,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:08,228 INFO L225 Difference]: With dead ends: 8876 [2019-12-27 03:16:08,229 INFO L226 Difference]: Without dead ends: 8876 [2019-12-27 03:16:08,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:16:08,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8876 states. [2019-12-27 03:16:08,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8876 to 8439. [2019-12-27 03:16:08,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8439 states. [2019-12-27 03:16:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8439 states to 8439 states and 19387 transitions. [2019-12-27 03:16:08,398 INFO L78 Accepts]: Start accepts. Automaton has 8439 states and 19387 transitions. Word has length 27 [2019-12-27 03:16:08,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:08,399 INFO L462 AbstractCegarLoop]: Abstraction has 8439 states and 19387 transitions. [2019-12-27 03:16:08,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:16:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 8439 states and 19387 transitions. [2019-12-27 03:16:08,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 03:16:08,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:08,410 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:16:08,410 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:08,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:08,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1366134434, now seen corresponding path program 1 times [2019-12-27 03:16:08,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:08,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757621544] [2019-12-27 03:16:08,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:08,482 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:16:08,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757621544] [2019-12-27 03:16:08,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:08,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:16:08,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042461717] [2019-12-27 03:16:08,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:16:08,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:08,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:16:08,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:16:08,484 INFO L87 Difference]: Start difference. First operand 8439 states and 19387 transitions. Second operand 3 states. [2019-12-27 03:16:08,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:08,589 INFO L93 Difference]: Finished difference Result 9584 states and 20860 transitions. [2019-12-27 03:16:08,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:16:08,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-27 03:16:08,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:08,604 INFO L225 Difference]: With dead ends: 9584 [2019-12-27 03:16:08,604 INFO L226 Difference]: Without dead ends: 9584 [2019-12-27 03:16:08,605 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:16:08,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9584 states. [2019-12-27 03:16:08,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9584 to 8440. [2019-12-27 03:16:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8440 states. [2019-12-27 03:16:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8440 states to 8440 states and 18504 transitions. [2019-12-27 03:16:08,788 INFO L78 Accepts]: Start accepts. Automaton has 8440 states and 18504 transitions. Word has length 30 [2019-12-27 03:16:08,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:08,788 INFO L462 AbstractCegarLoop]: Abstraction has 8440 states and 18504 transitions. [2019-12-27 03:16:08,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:16:08,789 INFO L276 IsEmpty]: Start isEmpty. Operand 8440 states and 18504 transitions. [2019-12-27 03:16:08,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 03:16:08,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:08,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:16:08,799 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:08,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:08,799 INFO L82 PathProgramCache]: Analyzing trace with hash -736726388, now seen corresponding path program 1 times [2019-12-27 03:16:08,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:08,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922526669] [2019-12-27 03:16:08,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:08,914 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:16:08,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922526669] [2019-12-27 03:16:08,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:08,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:16:08,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618700922] [2019-12-27 03:16:08,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:16:08,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:08,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:16:08,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:16:08,916 INFO L87 Difference]: Start difference. First operand 8440 states and 18504 transitions. Second operand 5 states. [2019-12-27 03:16:09,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:09,410 INFO L93 Difference]: Finished difference Result 9537 states and 20673 transitions. [2019-12-27 03:16:09,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:16:09,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 03:16:09,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:09,421 INFO L225 Difference]: With dead ends: 9537 [2019-12-27 03:16:09,421 INFO L226 Difference]: Without dead ends: 9537 [2019-12-27 03:16:09,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:16:09,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9537 states. [2019-12-27 03:16:09,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9537 to 7558. [2019-12-27 03:16:09,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7558 states. [2019-12-27 03:16:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7558 states to 7558 states and 16717 transitions. [2019-12-27 03:16:09,561 INFO L78 Accepts]: Start accepts. Automaton has 7558 states and 16717 transitions. Word has length 33 [2019-12-27 03:16:09,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:09,561 INFO L462 AbstractCegarLoop]: Abstraction has 7558 states and 16717 transitions. [2019-12-27 03:16:09,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:16:09,562 INFO L276 IsEmpty]: Start isEmpty. Operand 7558 states and 16717 transitions. [2019-12-27 03:16:09,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 03:16:09,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:09,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:16:09,574 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:09,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:09,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1616999435, now seen corresponding path program 1 times [2019-12-27 03:16:09,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:09,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836845540] [2019-12-27 03:16:09,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:09,641 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:16:09,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836845540] [2019-12-27 03:16:09,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:09,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:16:09,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844376909] [2019-12-27 03:16:09,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:16:09,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:09,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:16:09,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:16:09,644 INFO L87 Difference]: Start difference. First operand 7558 states and 16717 transitions. Second operand 4 states. [2019-12-27 03:16:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:09,680 INFO L93 Difference]: Finished difference Result 5263 states and 11555 transitions. [2019-12-27 03:16:09,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:16:09,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 03:16:09,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:09,689 INFO L225 Difference]: With dead ends: 5263 [2019-12-27 03:16:09,690 INFO L226 Difference]: Without dead ends: 5263 [2019-12-27 03:16:09,690 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:16:09,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2019-12-27 03:16:09,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5159. [2019-12-27 03:16:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5159 states. [2019-12-27 03:16:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5159 states to 5159 states and 11362 transitions. [2019-12-27 03:16:09,806 INFO L78 Accepts]: Start accepts. Automaton has 5159 states and 11362 transitions. Word has length 39 [2019-12-27 03:16:09,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:09,806 INFO L462 AbstractCegarLoop]: Abstraction has 5159 states and 11362 transitions. [2019-12-27 03:16:09,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:16:09,807 INFO L276 IsEmpty]: Start isEmpty. Operand 5159 states and 11362 transitions. [2019-12-27 03:16:09,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 03:16:09,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:09,823 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:16:09,824 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:09,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:09,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1602567421, now seen corresponding path program 1 times [2019-12-27 03:16:09,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:09,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117222347] [2019-12-27 03:16:09,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:09,955 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:16:09,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117222347] [2019-12-27 03:16:09,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:09,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:16:09,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311163284] [2019-12-27 03:16:09,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:16:09,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:09,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:16:09,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:16:09,958 INFO L87 Difference]: Start difference. First operand 5159 states and 11362 transitions. Second operand 8 states. [2019-12-27 03:16:10,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:10,396 INFO L93 Difference]: Finished difference Result 9824 states and 21398 transitions. [2019-12-27 03:16:10,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 03:16:10,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-27 03:16:10,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:10,408 INFO L225 Difference]: With dead ends: 9824 [2019-12-27 03:16:10,408 INFO L226 Difference]: Without dead ends: 8719 [2019-12-27 03:16:10,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:16:10,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8719 states. [2019-12-27 03:16:10,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8719 to 6443. [2019-12-27 03:16:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6443 states. [2019-12-27 03:16:10,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6443 states to 6443 states and 14388 transitions. [2019-12-27 03:16:10,543 INFO L78 Accepts]: Start accepts. Automaton has 6443 states and 14388 transitions. Word has length 68 [2019-12-27 03:16:10,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:10,543 INFO L462 AbstractCegarLoop]: Abstraction has 6443 states and 14388 transitions. [2019-12-27 03:16:10,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:16:10,544 INFO L276 IsEmpty]: Start isEmpty. Operand 6443 states and 14388 transitions. [2019-12-27 03:16:10,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 03:16:10,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:10,560 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:16:10,561 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:10,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:10,561 INFO L82 PathProgramCache]: Analyzing trace with hash -544831189, now seen corresponding path program 2 times [2019-12-27 03:16:10,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:10,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909759172] [2019-12-27 03:16:10,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:10,735 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:16:10,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909759172] [2019-12-27 03:16:10,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:10,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:16:10,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612255217] [2019-12-27 03:16:10,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:16:10,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:10,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:16:10,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:16:10,737 INFO L87 Difference]: Start difference. First operand 6443 states and 14388 transitions. Second operand 5 states. [2019-12-27 03:16:10,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:10,955 INFO L93 Difference]: Finished difference Result 9381 states and 20893 transitions. [2019-12-27 03:16:10,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:16:10,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-27 03:16:10,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:10,963 INFO L225 Difference]: With dead ends: 9381 [2019-12-27 03:16:10,963 INFO L226 Difference]: Without dead ends: 7879 [2019-12-27 03:16:10,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:16:10,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7879 states. [2019-12-27 03:16:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7879 to 7779. [2019-12-27 03:16:11,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7779 states. [2019-12-27 03:16:11,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7779 states to 7779 states and 17459 transitions. [2019-12-27 03:16:11,075 INFO L78 Accepts]: Start accepts. Automaton has 7779 states and 17459 transitions. Word has length 68 [2019-12-27 03:16:11,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:11,075 INFO L462 AbstractCegarLoop]: Abstraction has 7779 states and 17459 transitions. [2019-12-27 03:16:11,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:16:11,075 INFO L276 IsEmpty]: Start isEmpty. Operand 7779 states and 17459 transitions. [2019-12-27 03:16:11,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 03:16:11,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:11,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:16:11,094 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:11,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:11,095 INFO L82 PathProgramCache]: Analyzing trace with hash 402951891, now seen corresponding path program 3 times [2019-12-27 03:16:11,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:11,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693006738] [2019-12-27 03:16:11,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:11,201 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:16:11,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693006738] [2019-12-27 03:16:11,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:11,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:16:11,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310207279] [2019-12-27 03:16:11,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:16:11,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:11,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:16:11,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:16:11,203 INFO L87 Difference]: Start difference. First operand 7779 states and 17459 transitions. Second operand 8 states. [2019-12-27 03:16:11,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:11,653 INFO L93 Difference]: Finished difference Result 11922 states and 26443 transitions. [2019-12-27 03:16:11,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 03:16:11,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-27 03:16:11,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:11,666 INFO L225 Difference]: With dead ends: 11922 [2019-12-27 03:16:11,666 INFO L226 Difference]: Without dead ends: 11455 [2019-12-27 03:16:11,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:16:11,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11455 states. [2019-12-27 03:16:11,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11455 to 7833. [2019-12-27 03:16:11,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7833 states. [2019-12-27 03:16:11,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7833 states to 7833 states and 17576 transitions. [2019-12-27 03:16:11,799 INFO L78 Accepts]: Start accepts. Automaton has 7833 states and 17576 transitions. Word has length 68 [2019-12-27 03:16:11,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:11,799 INFO L462 AbstractCegarLoop]: Abstraction has 7833 states and 17576 transitions. [2019-12-27 03:16:11,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:16:11,799 INFO L276 IsEmpty]: Start isEmpty. Operand 7833 states and 17576 transitions. [2019-12-27 03:16:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 03:16:11,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:11,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:16:11,814 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:11,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:11,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1969468459, now seen corresponding path program 4 times [2019-12-27 03:16:11,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:11,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466928075] [2019-12-27 03:16:11,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:11,882 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:16:11,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466928075] [2019-12-27 03:16:11,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:11,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:16:11,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579531727] [2019-12-27 03:16:11,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:16:11,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:11,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:16:11,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:16:11,885 INFO L87 Difference]: Start difference. First operand 7833 states and 17576 transitions. Second operand 4 states. [2019-12-27 03:16:11,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:11,922 INFO L93 Difference]: Finished difference Result 8537 states and 19081 transitions. [2019-12-27 03:16:11,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:16:11,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-27 03:16:11,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:11,924 INFO L225 Difference]: With dead ends: 8537 [2019-12-27 03:16:11,924 INFO L226 Difference]: Without dead ends: 890 [2019-12-27 03:16:11,924 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:16:11,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-12-27 03:16:11,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2019-12-27 03:16:11,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-12-27 03:16:11,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1849 transitions. [2019-12-27 03:16:11,936 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1849 transitions. Word has length 68 [2019-12-27 03:16:11,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:11,936 INFO L462 AbstractCegarLoop]: Abstraction has 890 states and 1849 transitions. [2019-12-27 03:16:11,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:16:11,936 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1849 transitions. [2019-12-27 03:16:11,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 03:16:11,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:11,938 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:16:11,938 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:11,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:11,939 INFO L82 PathProgramCache]: Analyzing trace with hash 26038562, now seen corresponding path program 1 times [2019-12-27 03:16:11,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:11,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167551257] [2019-12-27 03:16:11,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:12,090 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:16:12,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167551257] [2019-12-27 03:16:12,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:12,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:16:12,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314354367] [2019-12-27 03:16:12,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:16:12,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:12,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:16:12,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:16:12,092 INFO L87 Difference]: Start difference. First operand 890 states and 1849 transitions. Second operand 3 states. [2019-12-27 03:16:12,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:12,104 INFO L93 Difference]: Finished difference Result 890 states and 1848 transitions. [2019-12-27 03:16:12,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:16:12,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-27 03:16:12,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:12,106 INFO L225 Difference]: With dead ends: 890 [2019-12-27 03:16:12,106 INFO L226 Difference]: Without dead ends: 890 [2019-12-27 03:16:12,107 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:16:12,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-12-27 03:16:12,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2019-12-27 03:16:12,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-12-27 03:16:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1848 transitions. [2019-12-27 03:16:12,118 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1848 transitions. Word has length 69 [2019-12-27 03:16:12,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:12,118 INFO L462 AbstractCegarLoop]: Abstraction has 890 states and 1848 transitions. [2019-12-27 03:16:12,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:16:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1848 transitions. [2019-12-27 03:16:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 03:16:12,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:12,121 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:16:12,121 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:12,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:12,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1220286072, now seen corresponding path program 1 times [2019-12-27 03:16:12,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:12,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176349829] [2019-12-27 03:16:12,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:12,432 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:16:12,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176349829] [2019-12-27 03:16:12,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:12,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:16:12,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876386324] [2019-12-27 03:16:12,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:16:12,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:12,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:16:12,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:16:12,434 INFO L87 Difference]: Start difference. First operand 890 states and 1848 transitions. Second operand 11 states. [2019-12-27 03:16:13,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:13,273 INFO L93 Difference]: Finished difference Result 1464 states and 2887 transitions. [2019-12-27 03:16:13,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:16:13,364 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-12-27 03:16:13,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:13,366 INFO L225 Difference]: With dead ends: 1464 [2019-12-27 03:16:13,366 INFO L226 Difference]: Without dead ends: 1440 [2019-12-27 03:16:13,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:16:13,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2019-12-27 03:16:13,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1159. [2019-12-27 03:16:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1159 states. [2019-12-27 03:16:13,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 2332 transitions. [2019-12-27 03:16:13,382 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 2332 transitions. Word has length 70 [2019-12-27 03:16:13,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:13,383 INFO L462 AbstractCegarLoop]: Abstraction has 1159 states and 2332 transitions. [2019-12-27 03:16:13,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:16:13,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 2332 transitions. [2019-12-27 03:16:13,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 03:16:13,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:13,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:16:13,385 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:13,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:13,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1670334514, now seen corresponding path program 2 times [2019-12-27 03:16:13,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:13,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745425208] [2019-12-27 03:16:13,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:13,528 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:16:13,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745425208] [2019-12-27 03:16:13,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:13,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:16:13,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834445513] [2019-12-27 03:16:13,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:16:13,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:13,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:16:13,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:16:13,530 INFO L87 Difference]: Start difference. First operand 1159 states and 2332 transitions. Second operand 5 states. [2019-12-27 03:16:13,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:13,607 INFO L93 Difference]: Finished difference Result 1300 states and 2608 transitions. [2019-12-27 03:16:13,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:16:13,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-27 03:16:13,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:13,610 INFO L225 Difference]: With dead ends: 1300 [2019-12-27 03:16:13,610 INFO L226 Difference]: Without dead ends: 1300 [2019-12-27 03:16:13,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:16:13,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2019-12-27 03:16:13,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1109. [2019-12-27 03:16:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2019-12-27 03:16:13,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 2238 transitions. [2019-12-27 03:16:13,622 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 2238 transitions. Word has length 70 [2019-12-27 03:16:13,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:13,622 INFO L462 AbstractCegarLoop]: Abstraction has 1109 states and 2238 transitions. [2019-12-27 03:16:13,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:16:13,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 2238 transitions. [2019-12-27 03:16:13,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 03:16:13,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:13,625 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:16:13,625 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:13,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:13,626 INFO L82 PathProgramCache]: Analyzing trace with hash 477046829, now seen corresponding path program 1 times [2019-12-27 03:16:13,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:13,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176654334] [2019-12-27 03:16:13,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:16:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:16:13,809 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:16:13,809 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:16:13,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~main$tmp_guard0~0_19 0) (= v_~main$tmp_guard1~0_73 0) (= 0 v_~x~0_344) (= 0 v_~x$w_buff0_used~0_997) (= (store .cse0 |v_ULTIMATE.start_main_~#t1725~0.base_51| 1) |v_#valid_72|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1725~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1725~0.base_51|) |v_ULTIMATE.start_main_~#t1725~0.offset_32| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p0_EAX~0_106) (= 0 v_~x$w_buff1~0_221) (= v_~y~0_54 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1725~0.base_51|)) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 |v_ULTIMATE.start_main_~#t1725~0.offset_32|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1725~0.base_51| 4)) (= v_~x$r_buff0_thd0~0_190 0) (= 0 v_~x$w_buff0~0_234) (= 0 v_~x$mem_tmp~0_169) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_599 0) (= 0 v_~__unbuffered_p1_EBX~0_105) (= v_~__unbuffered_p1_EAX~0_106 0) (= v_~x$r_buff1_thd0~0_225 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1725~0.base_51|) (= 0 v_~x$w_buff1_used~0_499) (= |v_#NULL.offset_5| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff0_thd2~0_403) (= v_~x$r_buff1_thd1~0_379 0) (= v_~x$flush_delayed~0_191 0) (= v_~weak$$choice2~0_254 0) (= 0 v_~__unbuffered_cnt~0_72) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= 0 v_~x$r_buff1_thd2~0_320))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_234, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_599, ULTIMATE.start_main_~#t1726~0.base=|v_ULTIMATE.start_main_~#t1726~0.base_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_191, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_147|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_379, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_73, ~x$mem_tmp~0=v_~x$mem_tmp~0_169, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_405|, ULTIMATE.start_main_~#t1725~0.offset=|v_ULTIMATE.start_main_~#t1725~0.offset_32|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_106, #length=|v_#length_17|, ~y~0=v_~y~0_54, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_190, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ULTIMATE.start_main_~#t1726~0.offset=|v_ULTIMATE.start_main_~#t1726~0.offset_18|, ~x$w_buff1~0=v_~x$w_buff1~0_221, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_499, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_320, ULTIMATE.start_main_~#t1725~0.base=|v_ULTIMATE.start_main_~#t1725~0.base_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_225, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_403, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_997, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~x~0=v_~x~0_344, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1726~0.base, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_~#t1725~0.offset, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1726~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1725~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet61, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite63, ~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:16:13,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1726~0.base_11| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1726~0.offset_10| 0) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1726~0.base_11|) 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1726~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1726~0.base_11| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1726~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1726~0.base_11|) |v_ULTIMATE.start_main_~#t1726~0.offset_10| 1))) (not (= |v_ULTIMATE.start_main_~#t1726~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1726~0.base=|v_ULTIMATE.start_main_~#t1726~0.base_11|, ULTIMATE.start_main_~#t1726~0.offset=|v_ULTIMATE.start_main_~#t1726~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1726~0.base, ULTIMATE.start_main_~#t1726~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-27 03:16:13,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-615874650)) (= ~x~0_In-615874650 ~x$mem_tmp~0_Out-615874650) (= ~x$flush_delayed~0_Out-615874650 ~weak$$choice2~0_Out-615874650) (= 1 ~x$r_buff0_thd1~0_Out-615874650) (= |P0Thread1of1ForFork1_#t~nondet3_In-615874650| ~weak$$choice0~0_Out-615874650) (= ~x$r_buff1_thd1~0_Out-615874650 ~x$r_buff0_thd1~0_In-615874650) (= ~x$r_buff1_thd0~0_Out-615874650 ~x$r_buff0_thd0~0_In-615874650) (= ~x$r_buff1_thd2~0_Out-615874650 ~x$r_buff0_thd2~0_In-615874650) (= |P0Thread1of1ForFork1_#t~nondet4_In-615874650| ~weak$$choice2~0_Out-615874650)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-615874650, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-615874650, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-615874650, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In-615874650|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-615874650, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In-615874650|, ~x~0=~x~0_In-615874650} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-615874650, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-615874650, ~x$flush_delayed~0=~x$flush_delayed~0_Out-615874650, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-615874650, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-615874650, ~x$mem_tmp~0=~x$mem_tmp~0_Out-615874650, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-615874650, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-615874650, ~weak$$choice0~0=~weak$$choice0~0_Out-615874650, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-615874650, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out-615874650|, ~weak$$choice2~0=~weak$$choice2~0_Out-615874650, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out-615874650|, ~x~0=~x~0_In-615874650} AuxVars[] AssignedVars[~weak$$choice0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~nondet3, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] because there is no mapped edge [2019-12-27 03:16:13,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L744-2-->L744-5: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In151199555 256) 0)) (.cse2 (= |P0Thread1of1ForFork1_#t~ite6_Out151199555| |P0Thread1of1ForFork1_#t~ite5_Out151199555|)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In151199555 256)))) (or (and (or .cse0 .cse1) .cse2 (= |P0Thread1of1ForFork1_#t~ite5_Out151199555| ~x$w_buff1~0_In151199555)) (and (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out151199555| ~x$w_buff0~0_In151199555) .cse2 (not .cse0)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In151199555, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In151199555, ~x$w_buff1~0=~x$w_buff1~0_In151199555, ~x$w_buff0_used~0=~x$w_buff0_used~0_In151199555} OutVars{~x$w_buff0~0=~x$w_buff0~0_In151199555, P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out151199555|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In151199555, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out151199555|, ~x$w_buff1~0=~x$w_buff1~0_In151199555, ~x$w_buff0_used~0=~x$w_buff0_used~0_In151199555} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 03:16:13,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~x$r_buff0_thd1~0_87 v_~x$r_buff0_thd1~0_86)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_55} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_11|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_86, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_55} 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:16:13,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In1831244600 256) 0))) (or (and (not .cse0) (= ~x$mem_tmp~0_In1831244600 |P0Thread1of1ForFork1_#t~ite25_Out1831244600|)) (and .cse0 (= ~x~0_In1831244600 |P0Thread1of1ForFork1_#t~ite25_Out1831244600|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1831244600, ~x$mem_tmp~0=~x$mem_tmp~0_In1831244600, ~x~0=~x~0_In1831244600} OutVars{P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out1831244600|, ~x$flush_delayed~0=~x$flush_delayed~0_In1831244600, ~x$mem_tmp~0=~x$mem_tmp~0_In1831244600, ~x~0=~x~0_In1831244600} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 03:16:13,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-1260549921 256) 0))) (or (and (not .cse0) (= ~x$mem_tmp~0_In-1260549921 |P1Thread1of1ForFork0_#t~ite54_Out-1260549921|)) (and (= ~x~0_In-1260549921 |P1Thread1of1ForFork0_#t~ite54_Out-1260549921|) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1260549921, ~x$mem_tmp~0=~x$mem_tmp~0_In-1260549921, ~x~0=~x~0_In-1260549921} OutVars{P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out-1260549921|, ~x$flush_delayed~0=~x$flush_delayed~0_In-1260549921, ~x$mem_tmp~0=~x$mem_tmp~0_In-1260549921, ~x~0=~x~0_In-1260549921} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 03:16:13,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In2120267080 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In2120267080 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In2120267080 |P1Thread1of1ForFork0_#t~ite55_Out2120267080|)) (and (= ~x$w_buff1~0_In2120267080 |P1Thread1of1ForFork0_#t~ite55_Out2120267080|) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2120267080, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2120267080, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2120267080, ~x~0=~x~0_In2120267080} OutVars{~x$w_buff1~0=~x$w_buff1~0_In2120267080, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2120267080, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2120267080, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out2120267080|, ~x~0=~x~0_In2120267080} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-27 03:16:13,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~x~0_77 |v_P1Thread1of1ForFork0_#t~ite55_10|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_10|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_13|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_9|, ~x~0=v_~x~0_77} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~x~0] because there is no mapped edge [2019-12-27 03:16:13,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In347155461 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In347155461 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In347155461 |P1Thread1of1ForFork0_#t~ite57_Out347155461|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite57_Out347155461|) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In347155461, ~x$w_buff0_used~0=~x$w_buff0_used~0_In347155461} OutVars{P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out347155461|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In347155461, ~x$w_buff0_used~0=~x$w_buff0_used~0_In347155461} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-27 03:16:13,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In482053743 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In482053743 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In482053743 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In482053743 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite58_Out482053743|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In482053743 |P1Thread1of1ForFork0_#t~ite58_Out482053743|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In482053743, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In482053743, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In482053743, ~x$w_buff0_used~0=~x$w_buff0_used~0_In482053743} OutVars{P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out482053743|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In482053743, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In482053743, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In482053743, ~x$w_buff0_used~0=~x$w_buff0_used~0_In482053743} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-27 03:16:13,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-619061456 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-619061456 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-619061456 |P1Thread1of1ForFork0_#t~ite59_Out-619061456|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite59_Out-619061456|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-619061456, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-619061456} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-619061456, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out-619061456|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-619061456} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-27 03:16:13,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1929578425 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1929578425 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1929578425 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1929578425 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite60_Out-1929578425|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd2~0_In-1929578425 |P1Thread1of1ForFork0_#t~ite60_Out-1929578425|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1929578425, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1929578425, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1929578425, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1929578425} OutVars{P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-1929578425|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1929578425, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1929578425, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1929578425, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1929578425} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-27 03:16:13,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_36|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_192, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 03:16:13,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1449334202 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1449334202 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite28_Out-1449334202| ~x$w_buff0_used~0_In-1449334202) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite28_Out-1449334202| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1449334202, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1449334202} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1449334202, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out-1449334202|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1449334202} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 03:16:13,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L761-->L761-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1915664299 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1915664299 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In1915664299 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1915664299 256)))) (or (and (= ~x$w_buff1_used~0_In1915664299 |P0Thread1of1ForFork1_#t~ite29_Out1915664299|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite29_Out1915664299|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1915664299, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1915664299, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1915664299, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1915664299} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1915664299, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out1915664299|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1915664299, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1915664299, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1915664299} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 03:16:13,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L762-->L763: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In630695551 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In630695551 256)))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd1~0_Out630695551) (not .cse1)) (and (= ~x$r_buff0_thd1~0_Out630695551 ~x$r_buff0_thd1~0_In630695551) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In630695551, ~x$w_buff0_used~0=~x$w_buff0_used~0_In630695551} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out630695551, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out630695551|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In630695551} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 03:16:13,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L763-->L763-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In440212252 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In440212252 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In440212252 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In440212252 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite31_Out440212252|)) (and (= ~x$r_buff1_thd1~0_In440212252 |P0Thread1of1ForFork1_#t~ite31_Out440212252|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In440212252, ~x$w_buff1_used~0=~x$w_buff1_used~0_In440212252, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In440212252, ~x$w_buff0_used~0=~x$w_buff0_used~0_In440212252} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In440212252, ~x$w_buff1_used~0=~x$w_buff1_used~0_In440212252, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In440212252, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out440212252|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In440212252} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 03:16:13,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_36|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_36|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_35|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 03:16:13,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 2 v_~__unbuffered_cnt~0_18)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:16:13,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L826-2-->L826-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite63_Out1003392606| |ULTIMATE.start_main_#t~ite64_Out1003392606|)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1003392606 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1003392606 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out1003392606| ~x$w_buff1~0_In1003392606) .cse0 (not .cse1) (not .cse2)) (and .cse0 (= ~x~0_In1003392606 |ULTIMATE.start_main_#t~ite63_Out1003392606|) (or .cse1 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1003392606, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1003392606, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1003392606, ~x~0=~x~0_In1003392606} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1003392606|, ~x$w_buff1~0=~x$w_buff1~0_In1003392606, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1003392606, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1003392606, ~x~0=~x~0_In1003392606, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1003392606|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-27 03:16:13,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L827-->L827-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1527065917 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1527065917 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite65_Out-1527065917|) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1527065917 |ULTIMATE.start_main_#t~ite65_Out-1527065917|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1527065917, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1527065917} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1527065917, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-1527065917|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1527065917} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-27 03:16:13,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L828-->L828-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In704953257 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In704953257 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In704953257 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In704953257 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite66_Out704953257|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In704953257 |ULTIMATE.start_main_#t~ite66_Out704953257|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In704953257, ~x$w_buff1_used~0=~x$w_buff1_used~0_In704953257, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In704953257, ~x$w_buff0_used~0=~x$w_buff0_used~0_In704953257} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In704953257, ~x$w_buff1_used~0=~x$w_buff1_used~0_In704953257, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out704953257|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In704953257, ~x$w_buff0_used~0=~x$w_buff0_used~0_In704953257} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-27 03:16:13,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1468448413 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1468448413 256)))) (or (and (= |ULTIMATE.start_main_#t~ite67_Out-1468448413| ~x$r_buff0_thd0~0_In-1468448413) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite67_Out-1468448413|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1468448413, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1468448413} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1468448413, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-1468448413|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1468448413} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-27 03:16:13,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1012] [1012] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1382137062 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1382137062 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1382137062 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1382137062 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-1382137062 |ULTIMATE.start_main_#t~ite68_Out-1382137062|)) (and (= |ULTIMATE.start_main_#t~ite68_Out-1382137062| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1382137062, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1382137062, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1382137062, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1382137062} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1382137062, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1382137062, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-1382137062|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1382137062, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1382137062} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-27 03:16:13,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~x$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_83|) (= 1 v_~__unbuffered_p1_EAX~0_73) (= v_~__unbuffered_p0_EBX~0_47 0) (= v_~__unbuffered_p1_EBX~0_62 0) (= v_~main$tmp_guard1~0_40 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_83|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_188, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:16:13,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:16:13 BasicIcfg [2019-12-27 03:16:13,956 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:16:13,958 INFO L168 Benchmark]: Toolchain (without parser) took 22386.81 ms. Allocated memory was 137.4 MB in the beginning and 834.1 MB in the end (delta: 696.8 MB). Free memory was 99.2 MB in the beginning and 546.2 MB in the end (delta: -447.0 MB). Peak memory consumption was 249.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:16:13,958 INFO L168 Benchmark]: CDTParser took 0.68 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 03:16:13,959 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.35 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 99.0 MB in the beginning and 154.8 MB in the end (delta: -55.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 03:16:13,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.77 ms. Allocated memory is still 201.9 MB. Free memory was 154.8 MB in the beginning and 151.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 03:16:13,960 INFO L168 Benchmark]: Boogie Preprocessor took 39.57 ms. Allocated memory is still 201.9 MB. Free memory was 151.5 MB in the beginning and 148.7 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:16:13,961 INFO L168 Benchmark]: RCFGBuilder took 1057.85 ms. Allocated memory is still 201.9 MB. Free memory was 148.7 MB in the beginning and 92.3 MB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. [2019-12-27 03:16:13,962 INFO L168 Benchmark]: TraceAbstraction took 20451.73 ms. Allocated memory was 201.9 MB in the beginning and 834.1 MB in the end (delta: 632.3 MB). Free memory was 92.3 MB in the beginning and 546.2 MB in the end (delta: -453.8 MB). Peak memory consumption was 178.5 MB. Max. memory is 7.1 GB. [2019-12-27 03:16:13,966 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.68 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 769.35 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 99.0 MB in the beginning and 154.8 MB in the end (delta: -55.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.77 ms. Allocated memory is still 201.9 MB. Free memory was 154.8 MB in the beginning and 151.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.57 ms. Allocated memory is still 201.9 MB. Free memory was 151.5 MB in the beginning and 148.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1057.85 ms. Allocated memory is still 201.9 MB. Free memory was 148.7 MB in the beginning and 92.3 MB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20451.73 ms. Allocated memory was 201.9 MB in the beginning and 834.1 MB in the end (delta: 632.3 MB). Free memory was 92.3 MB in the beginning and 546.2 MB in the end (delta: -453.8 MB). Peak memory consumption was 178.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 191 ProgramPointsBefore, 113 ProgramPointsAfterwards, 246 TransitionsBefore, 136 TransitionsAfterwards, 27428 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 35 ChoiceCompositions, 9685 VarBasedMoverChecksPositive, 320 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 419 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 0 MoverChecksTotal, 146813 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1725, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L820] FCALL, FORK 0 pthread_create(&t1726, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L729] 1 x$w_buff1 = x$w_buff0 [L730] 1 x$w_buff0 = 1 [L731] 1 x$w_buff1_used = x$w_buff0_used [L732] 1 x$w_buff0_used = (_Bool)1 [L744] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 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) [L745] 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 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)) [L746] 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L746] 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)) [L747] 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 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)) [L748] 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L748] 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)) [L750] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L750] 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)) [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 1 x = x$flush_delayed ? x$mem_tmp : x [L753] 1 x$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 [L776] 2 __unbuffered_p1_EAX = y [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 x$flush_delayed = weak$$choice2 [L782] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L784] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? 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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L784] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L785] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? 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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L786] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L786] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L787] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L788] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L789] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L791] 2 x = x$flush_delayed ? x$mem_tmp : x [L792] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 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 [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L826] EXPR 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 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 [L829] 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, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 20.1s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3746 SDtfs, 3171 SDslu, 8438 SDs, 0 SdLazy, 2660 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29658occurred 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: 4.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 12606 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 741 NumberOfCodeBlocks, 741 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 654 ConstructedInterpolants, 0 QuantifiedInterpolants, 186162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...