/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:58:57,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:58:57,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:58:57,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:58:57,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:58:57,118 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:58:57,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:58:57,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:58:57,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:58:57,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:58:57,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:58:57,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:58:57,131 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:58:57,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:58:57,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:58:57,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:58:57,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:58:57,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:58:57,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:58:57,139 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:58:57,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:58:57,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:58:57,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:58:57,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:58:57,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:58:57,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:58:57,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:58:57,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:58:57,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:58:57,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:58:57,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:58:57,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:58:57,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:58:57,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:58:57,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:58:57,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:58:57,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:58:57,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:58:57,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:58:57,153 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:58:57,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:58:57,155 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:58:57,170 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:58:57,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:58:57,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:58:57,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:58:57,173 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:58:57,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:58:57,174 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:58:57,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:58:57,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:58:57,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:58:57,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:58:57,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:58:57,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:58:57,176 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:58:57,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:58:57,176 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:58:57,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:58:57,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:58:57,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:58:57,177 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:58:57,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:58:57,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:58:57,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:58:57,180 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:58:57,180 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:58:57,180 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:58:57,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:58:57,180 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:58:57,181 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:58:57,181 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:58:57,458 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:58:57,471 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:58:57,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:58:57,476 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:58:57,476 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:58:57,477 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc.i [2019-12-18 21:58:57,548 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/261199931/d892c08c72bf4f64b3b979a0a62fb684/FLAG25ec08449 [2019-12-18 21:58:58,119 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:58:58,119 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc.i [2019-12-18 21:58:58,134 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/261199931/d892c08c72bf4f64b3b979a0a62fb684/FLAG25ec08449 [2019-12-18 21:58:58,363 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/261199931/d892c08c72bf4f64b3b979a0a62fb684 [2019-12-18 21:58:58,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:58:58,375 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:58:58,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:58:58,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:58:58,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:58:58,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:58:58" (1/1) ... [2019-12-18 21:58:58,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f0f0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:58, skipping insertion in model container [2019-12-18 21:58:58,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:58:58" (1/1) ... [2019-12-18 21:58:58,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:58:58,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:58:58,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:58:58,990 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:58:59,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:58:59,150 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:58:59,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:59 WrapperNode [2019-12-18 21:58:59,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:58:59,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:58:59,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:58:59,152 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:58:59,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:59" (1/1) ... [2019-12-18 21:58:59,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:59" (1/1) ... [2019-12-18 21:58:59,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:58:59,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:58:59,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:58:59,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:58:59,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:59" (1/1) ... [2019-12-18 21:58:59,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:59" (1/1) ... [2019-12-18 21:58:59,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:59" (1/1) ... [2019-12-18 21:58:59,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:59" (1/1) ... [2019-12-18 21:58:59,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:59" (1/1) ... [2019-12-18 21:58:59,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:59" (1/1) ... [2019-12-18 21:58:59,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:59" (1/1) ... [2019-12-18 21:58:59,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:58:59,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:58:59,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:58:59,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:58:59,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:58:59,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:58:59,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:58:59,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:58:59,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:58:59,329 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:58:59,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:58:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:58:59,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:58:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:58:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:58:59,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:58:59,332 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:59:00,067 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:59:00,067 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:59:00,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:59:00 BoogieIcfgContainer [2019-12-18 21:59:00,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:59:00,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:59:00,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:59:00,074 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:59:00,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:58:58" (1/3) ... [2019-12-18 21:59:00,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd069a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:59:00, skipping insertion in model container [2019-12-18 21:59:00,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:59" (2/3) ... [2019-12-18 21:59:00,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd069a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:59:00, skipping insertion in model container [2019-12-18 21:59:00,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:59:00" (3/3) ... [2019-12-18 21:59:00,078 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_power.oepc.i [2019-12-18 21:59:00,089 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:59:00,089 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:59:00,099 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:59:00,100 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:59:00,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,145 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,145 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,145 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,146 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,147 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,156 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,156 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,207 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,208 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,208 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,216 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,220 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:00,238 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:59:00,264 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:59:00,264 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:59:00,264 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:59:00,265 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:59:00,265 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:59:00,265 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:59:00,265 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:59:00,265 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:59:00,311 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-18 21:59:00,313 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 21:59:00,389 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 21:59:00,389 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:59:00,406 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 350 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:59:00,425 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 21:59:00,465 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 21:59:00,465 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:59:00,471 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 350 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:59:00,485 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 21:59:00,486 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:59:03,673 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 21:59:03,791 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 21:59:03,817 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49085 [2019-12-18 21:59:03,817 INFO L214 etLargeBlockEncoding]: Total number of compositions: 102 [2019-12-18 21:59:03,821 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-18 21:59:04,225 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8066 states. [2019-12-18 21:59:04,227 INFO L276 IsEmpty]: Start isEmpty. Operand 8066 states. [2019-12-18 21:59:04,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:59:04,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:04,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:59:04,235 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:04,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:04,241 INFO L82 PathProgramCache]: Analyzing trace with hash 791333, now seen corresponding path program 1 times [2019-12-18 21:59:04,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:04,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798846855] [2019-12-18 21:59:04,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:04,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:04,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798846855] [2019-12-18 21:59:04,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:04,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:59:04,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615391583] [2019-12-18 21:59:04,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:59:04,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:04,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:59:04,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:04,475 INFO L87 Difference]: Start difference. First operand 8066 states. Second operand 3 states. [2019-12-18 21:59:04,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:04,776 INFO L93 Difference]: Finished difference Result 7932 states and 26018 transitions. [2019-12-18 21:59:04,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:59:04,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:59:04,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:04,876 INFO L225 Difference]: With dead ends: 7932 [2019-12-18 21:59:04,876 INFO L226 Difference]: Without dead ends: 7440 [2019-12-18 21:59:04,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:05,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7440 states. [2019-12-18 21:59:05,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7440 to 7440. [2019-12-18 21:59:05,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7440 states. [2019-12-18 21:59:05,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7440 states to 7440 states and 24357 transitions. [2019-12-18 21:59:05,446 INFO L78 Accepts]: Start accepts. Automaton has 7440 states and 24357 transitions. Word has length 3 [2019-12-18 21:59:05,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:05,446 INFO L462 AbstractCegarLoop]: Abstraction has 7440 states and 24357 transitions. [2019-12-18 21:59:05,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:05,447 INFO L276 IsEmpty]: Start isEmpty. Operand 7440 states and 24357 transitions. [2019-12-18 21:59:05,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:59:05,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:05,452 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:05,453 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:05,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:05,453 INFO L82 PathProgramCache]: Analyzing trace with hash 912855206, now seen corresponding path program 1 times [2019-12-18 21:59:05,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:05,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437525255] [2019-12-18 21:59:05,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:05,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:05,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437525255] [2019-12-18 21:59:05,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:05,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:59:05,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226315671] [2019-12-18 21:59:05,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:59:05,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:05,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:59:05,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:05,561 INFO L87 Difference]: Start difference. First operand 7440 states and 24357 transitions. Second operand 3 states. [2019-12-18 21:59:05,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:05,607 INFO L93 Difference]: Finished difference Result 1230 states and 2824 transitions. [2019-12-18 21:59:05,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:59:05,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 21:59:05,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:05,615 INFO L225 Difference]: With dead ends: 1230 [2019-12-18 21:59:05,615 INFO L226 Difference]: Without dead ends: 1230 [2019-12-18 21:59:05,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:05,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-12-18 21:59:05,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2019-12-18 21:59:05,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-18 21:59:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2824 transitions. [2019-12-18 21:59:05,661 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2824 transitions. Word has length 11 [2019-12-18 21:59:05,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:05,661 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2824 transitions. [2019-12-18 21:59:05,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:05,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2824 transitions. [2019-12-18 21:59:05,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:59:05,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:05,671 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:05,671 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:05,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:05,671 INFO L82 PathProgramCache]: Analyzing trace with hash 124584310, now seen corresponding path program 1 times [2019-12-18 21:59:05,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:05,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375726360] [2019-12-18 21:59:05,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:05,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375726360] [2019-12-18 21:59:05,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:05,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:59:05,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424739360] [2019-12-18 21:59:05,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:59:05,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:05,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:59:05,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:05,806 INFO L87 Difference]: Start difference. First operand 1230 states and 2824 transitions. Second operand 3 states. [2019-12-18 21:59:05,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:05,918 INFO L93 Difference]: Finished difference Result 1956 states and 4348 transitions. [2019-12-18 21:59:05,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:59:05,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 21:59:05,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:05,933 INFO L225 Difference]: With dead ends: 1956 [2019-12-18 21:59:05,934 INFO L226 Difference]: Without dead ends: 1956 [2019-12-18 21:59:05,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:05,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2019-12-18 21:59:05,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1356. [2019-12-18 21:59:05,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1356 states. [2019-12-18 21:59:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 3081 transitions. [2019-12-18 21:59:05,994 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 3081 transitions. Word has length 14 [2019-12-18 21:59:05,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:05,995 INFO L462 AbstractCegarLoop]: Abstraction has 1356 states and 3081 transitions. [2019-12-18 21:59:05,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:05,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 3081 transitions. [2019-12-18 21:59:05,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:59:05,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:05,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:05,997 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:05,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:05,997 INFO L82 PathProgramCache]: Analyzing trace with hash 35390056, now seen corresponding path program 1 times [2019-12-18 21:59:05,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:05,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001764771] [2019-12-18 21:59:05,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:06,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:06,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001764771] [2019-12-18 21:59:06,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:06,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:59:06,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291918503] [2019-12-18 21:59:06,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:59:06,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:06,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:59:06,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:59:06,128 INFO L87 Difference]: Start difference. First operand 1356 states and 3081 transitions. Second operand 4 states. [2019-12-18 21:59:06,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:06,303 INFO L93 Difference]: Finished difference Result 1678 states and 3739 transitions. [2019-12-18 21:59:06,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:59:06,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:59:06,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:06,312 INFO L225 Difference]: With dead ends: 1678 [2019-12-18 21:59:06,312 INFO L226 Difference]: Without dead ends: 1678 [2019-12-18 21:59:06,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:06,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-12-18 21:59:06,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1618. [2019-12-18 21:59:06,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-12-18 21:59:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 3623 transitions. [2019-12-18 21:59:06,405 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 3623 transitions. Word has length 14 [2019-12-18 21:59:06,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:06,405 INFO L462 AbstractCegarLoop]: Abstraction has 1618 states and 3623 transitions. [2019-12-18 21:59:06,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:59:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 3623 transitions. [2019-12-18 21:59:06,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:59:06,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:06,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:06,407 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:06,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:06,407 INFO L82 PathProgramCache]: Analyzing trace with hash 801099966, now seen corresponding path program 1 times [2019-12-18 21:59:06,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:06,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825363783] [2019-12-18 21:59:06,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:06,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:06,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825363783] [2019-12-18 21:59:06,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:06,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:59:06,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113461347] [2019-12-18 21:59:06,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:59:06,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:06,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:59:06,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:59:06,458 INFO L87 Difference]: Start difference. First operand 1618 states and 3623 transitions. Second operand 4 states. [2019-12-18 21:59:06,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:06,625 INFO L93 Difference]: Finished difference Result 1981 states and 4398 transitions. [2019-12-18 21:59:06,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:59:06,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:59:06,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:06,636 INFO L225 Difference]: With dead ends: 1981 [2019-12-18 21:59:06,636 INFO L226 Difference]: Without dead ends: 1981 [2019-12-18 21:59:06,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:06,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-12-18 21:59:06,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1706. [2019-12-18 21:59:06,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2019-12-18 21:59:06,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 3834 transitions. [2019-12-18 21:59:06,679 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 3834 transitions. Word has length 14 [2019-12-18 21:59:06,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:06,680 INFO L462 AbstractCegarLoop]: Abstraction has 1706 states and 3834 transitions. [2019-12-18 21:59:06,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:59:06,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 3834 transitions. [2019-12-18 21:59:06,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:59:06,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:06,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:06,683 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:06,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:06,683 INFO L82 PathProgramCache]: Analyzing trace with hash -738044695, now seen corresponding path program 1 times [2019-12-18 21:59:06,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:06,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876416019] [2019-12-18 21:59:06,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:06,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876416019] [2019-12-18 21:59:06,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:06,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:59:06,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348694146] [2019-12-18 21:59:06,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:59:06,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:06,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:59:06,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:06,746 INFO L87 Difference]: Start difference. First operand 1706 states and 3834 transitions. Second operand 5 states. [2019-12-18 21:59:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:06,983 INFO L93 Difference]: Finished difference Result 2240 states and 4897 transitions. [2019-12-18 21:59:06,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:59:06,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 21:59:06,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:07,004 INFO L225 Difference]: With dead ends: 2240 [2019-12-18 21:59:07,010 INFO L226 Difference]: Without dead ends: 2240 [2019-12-18 21:59:07,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:59:07,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2019-12-18 21:59:07,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1991. [2019-12-18 21:59:07,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1991 states. [2019-12-18 21:59:07,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 4418 transitions. [2019-12-18 21:59:07,069 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 4418 transitions. Word has length 25 [2019-12-18 21:59:07,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:07,070 INFO L462 AbstractCegarLoop]: Abstraction has 1991 states and 4418 transitions. [2019-12-18 21:59:07,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:59:07,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 4418 transitions. [2019-12-18 21:59:07,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:59:07,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:07,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:07,073 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:07,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:07,073 INFO L82 PathProgramCache]: Analyzing trace with hash 602591181, now seen corresponding path program 1 times [2019-12-18 21:59:07,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:07,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089680945] [2019-12-18 21:59:07,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:07,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089680945] [2019-12-18 21:59:07,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:07,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:59:07,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576010908] [2019-12-18 21:59:07,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:59:07,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:07,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:59:07,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:07,154 INFO L87 Difference]: Start difference. First operand 1991 states and 4418 transitions. Second operand 3 states. [2019-12-18 21:59:07,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:07,198 INFO L93 Difference]: Finished difference Result 2574 states and 5503 transitions. [2019-12-18 21:59:07,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:59:07,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-18 21:59:07,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:07,211 INFO L225 Difference]: With dead ends: 2574 [2019-12-18 21:59:07,211 INFO L226 Difference]: Without dead ends: 2574 [2019-12-18 21:59:07,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2019-12-18 21:59:07,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 1963. [2019-12-18 21:59:07,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-12-18 21:59:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 4214 transitions. [2019-12-18 21:59:07,276 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 4214 transitions. Word has length 25 [2019-12-18 21:59:07,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:07,277 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 4214 transitions. [2019-12-18 21:59:07,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 4214 transitions. [2019-12-18 21:59:07,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:59:07,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:07,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:07,280 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:07,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:07,280 INFO L82 PathProgramCache]: Analyzing trace with hash -2104804157, now seen corresponding path program 1 times [2019-12-18 21:59:07,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:07,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631077097] [2019-12-18 21:59:07,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:07,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:07,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631077097] [2019-12-18 21:59:07,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:07,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:59:07,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603517090] [2019-12-18 21:59:07,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:59:07,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:07,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:59:07,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:59:07,356 INFO L87 Difference]: Start difference. First operand 1963 states and 4214 transitions. Second operand 4 states. [2019-12-18 21:59:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:07,371 INFO L93 Difference]: Finished difference Result 1053 states and 2169 transitions. [2019-12-18 21:59:07,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:59:07,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-18 21:59:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:07,379 INFO L225 Difference]: With dead ends: 1053 [2019-12-18 21:59:07,379 INFO L226 Difference]: Without dead ends: 1053 [2019-12-18 21:59:07,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:59:07,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-12-18 21:59:07,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 995. [2019-12-18 21:59:07,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-12-18 21:59:07,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 2062 transitions. [2019-12-18 21:59:07,403 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 2062 transitions. Word has length 26 [2019-12-18 21:59:07,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:07,404 INFO L462 AbstractCegarLoop]: Abstraction has 995 states and 2062 transitions. [2019-12-18 21:59:07,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:59:07,404 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 2062 transitions. [2019-12-18 21:59:07,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:59:07,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:07,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:07,407 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:07,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:07,407 INFO L82 PathProgramCache]: Analyzing trace with hash -134458557, now seen corresponding path program 1 times [2019-12-18 21:59:07,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:07,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806706239] [2019-12-18 21:59:07,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:07,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:07,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806706239] [2019-12-18 21:59:07,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:07,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:59:07,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142265322] [2019-12-18 21:59:07,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:59:07,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:07,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:59:07,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:07,505 INFO L87 Difference]: Start difference. First operand 995 states and 2062 transitions. Second operand 5 states. [2019-12-18 21:59:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:07,698 INFO L93 Difference]: Finished difference Result 1129 states and 2304 transitions. [2019-12-18 21:59:07,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:59:07,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 21:59:07,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:07,704 INFO L225 Difference]: With dead ends: 1129 [2019-12-18 21:59:07,704 INFO L226 Difference]: Without dead ends: 1129 [2019-12-18 21:59:07,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:59:07,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-12-18 21:59:07,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 904. [2019-12-18 21:59:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-12-18 21:59:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1874 transitions. [2019-12-18 21:59:07,729 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1874 transitions. Word has length 26 [2019-12-18 21:59:07,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:07,730 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1874 transitions. [2019-12-18 21:59:07,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:59:07,730 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1874 transitions. [2019-12-18 21:59:07,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:59:07,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:07,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:07,736 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:07,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:07,736 INFO L82 PathProgramCache]: Analyzing trace with hash 830310095, now seen corresponding path program 1 times [2019-12-18 21:59:07,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:07,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60051986] [2019-12-18 21:59:07,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:07,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60051986] [2019-12-18 21:59:07,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:07,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:59:07,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937784891] [2019-12-18 21:59:07,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:59:07,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:07,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:59:07,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:07,817 INFO L87 Difference]: Start difference. First operand 904 states and 1874 transitions. Second operand 3 states. [2019-12-18 21:59:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:07,831 INFO L93 Difference]: Finished difference Result 1410 states and 2964 transitions. [2019-12-18 21:59:07,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:59:07,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 21:59:07,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:07,834 INFO L225 Difference]: With dead ends: 1410 [2019-12-18 21:59:07,834 INFO L226 Difference]: Without dead ends: 548 [2019-12-18 21:59:07,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:07,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-12-18 21:59:07,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2019-12-18 21:59:07,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-12-18 21:59:07,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1169 transitions. [2019-12-18 21:59:07,899 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1169 transitions. Word has length 51 [2019-12-18 21:59:07,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:07,899 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 1169 transitions. [2019-12-18 21:59:07,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:07,900 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1169 transitions. [2019-12-18 21:59:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:59:07,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:07,903 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:07,904 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:07,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:07,904 INFO L82 PathProgramCache]: Analyzing trace with hash 365260025, now seen corresponding path program 2 times [2019-12-18 21:59:07,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:07,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32766505] [2019-12-18 21:59:07,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:08,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:08,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32766505] [2019-12-18 21:59:08,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:08,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:59:08,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404307434] [2019-12-18 21:59:08,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:59:08,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:08,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:59:08,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:59:08,042 INFO L87 Difference]: Start difference. First operand 548 states and 1169 transitions. Second operand 7 states. [2019-12-18 21:59:08,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:08,239 INFO L93 Difference]: Finished difference Result 1122 states and 2322 transitions. [2019-12-18 21:59:08,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:59:08,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 21:59:08,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:08,241 INFO L225 Difference]: With dead ends: 1122 [2019-12-18 21:59:08,242 INFO L226 Difference]: Without dead ends: 775 [2019-12-18 21:59:08,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:59:08,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-12-18 21:59:08,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 613. [2019-12-18 21:59:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-12-18 21:59:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1276 transitions. [2019-12-18 21:59:08,257 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1276 transitions. Word has length 51 [2019-12-18 21:59:08,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:08,257 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 1276 transitions. [2019-12-18 21:59:08,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:59:08,258 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1276 transitions. [2019-12-18 21:59:08,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:59:08,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:08,260 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:08,260 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:08,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:08,260 INFO L82 PathProgramCache]: Analyzing trace with hash 372470905, now seen corresponding path program 3 times [2019-12-18 21:59:08,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:08,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768777851] [2019-12-18 21:59:08,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:08,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:08,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768777851] [2019-12-18 21:59:08,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:08,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:59:08,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932410353] [2019-12-18 21:59:08,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:59:08,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:08,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:59:08,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:08,346 INFO L87 Difference]: Start difference. First operand 613 states and 1276 transitions. Second operand 3 states. [2019-12-18 21:59:08,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:08,391 INFO L93 Difference]: Finished difference Result 758 states and 1575 transitions. [2019-12-18 21:59:08,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:59:08,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 21:59:08,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:08,394 INFO L225 Difference]: With dead ends: 758 [2019-12-18 21:59:08,394 INFO L226 Difference]: Without dead ends: 758 [2019-12-18 21:59:08,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:08,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-12-18 21:59:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 670. [2019-12-18 21:59:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-18 21:59:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1399 transitions. [2019-12-18 21:59:08,410 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1399 transitions. Word has length 51 [2019-12-18 21:59:08,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:08,410 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1399 transitions. [2019-12-18 21:59:08,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:08,410 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1399 transitions. [2019-12-18 21:59:08,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:59:08,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:08,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:08,414 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:08,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:08,415 INFO L82 PathProgramCache]: Analyzing trace with hash 679432093, now seen corresponding path program 1 times [2019-12-18 21:59:08,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:08,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187726303] [2019-12-18 21:59:08,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:08,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:08,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187726303] [2019-12-18 21:59:08,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:08,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:59:08,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743582698] [2019-12-18 21:59:08,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:59:08,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:08,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:59:08,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:08,489 INFO L87 Difference]: Start difference. First operand 670 states and 1399 transitions. Second operand 3 states. [2019-12-18 21:59:08,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:08,500 INFO L93 Difference]: Finished difference Result 670 states and 1398 transitions. [2019-12-18 21:59:08,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:59:08,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:59:08,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:08,502 INFO L225 Difference]: With dead ends: 670 [2019-12-18 21:59:08,503 INFO L226 Difference]: Without dead ends: 670 [2019-12-18 21:59:08,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:08,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-12-18 21:59:08,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2019-12-18 21:59:08,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-18 21:59:08,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1398 transitions. [2019-12-18 21:59:08,517 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1398 transitions. Word has length 52 [2019-12-18 21:59:08,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:08,518 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1398 transitions. [2019-12-18 21:59:08,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:08,518 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1398 transitions. [2019-12-18 21:59:08,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:59:08,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:08,520 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] [2019-12-18 21:59:08,520 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:08,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:08,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1093323660, now seen corresponding path program 1 times [2019-12-18 21:59:08,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:08,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684181503] [2019-12-18 21:59:08,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:59:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:59:08,687 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:59:08,687 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:59:08,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 |v_ULTIMATE.start_main_~#t1601~0.offset_18|) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd0~0_27 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~x$w_buff1~0_22) (= v_~y~0_18 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_15 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1601~0.base_23| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1601~0.base_23|) |v_ULTIMATE.start_main_~#t1601~0.offset_18| 0)) |v_#memory_int_11|) (= 0 v_~x$w_buff0_used~0_100) (= |v_#valid_46| (store .cse0 |v_ULTIMATE.start_main_~#t1601~0.base_23| 1)) (= 0 v_~x$w_buff0~0_23) (= 0 v_~x$r_buff0_thd0~0_19) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1601~0.base_23| 4)) (= 0 v_~x$r_buff0_thd2~0_78) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$read_delayed~0_6) (= v_~x$r_buff1_thd2~0_49 0) (= v_~x$mem_tmp~0_8 0) (= 0 v_~x$r_buff0_thd1~0_27) (= 0 |v_#NULL.base_6|) (= v_~x$r_buff1_thd1~0_21 0) (= v_~x$flush_delayed~0_11 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1601~0.base_23|)) (= 0 v_~weak$$choice2~0_35) (= v_~x~0_22 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1601~0.base_23|) (= v_~x$w_buff1_used~0_64 0) (= 0 v_~z~0_8) (= 0 v_~__unbuffered_cnt~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ULTIMATE.start_main_~#t1602~0.base=|v_ULTIMATE.start_main_~#t1602~0.base_22|, ~x$flush_delayed~0=v_~x$flush_delayed~0_11, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_8, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_~#t1601~0.base=|v_ULTIMATE.start_main_~#t1601~0.base_23|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_19|, ULTIMATE.start_main_~#t1601~0.offset=|v_ULTIMATE.start_main_~#t1601~0.offset_18|, ~y~0=v_~y~0_18, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_19, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ~x$w_buff1~0=v_~x$w_buff1~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_49, ULTIMATE.start_main_~#t1602~0.offset=|v_ULTIMATE.start_main_~#t1602~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_27, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_78, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~x~0=v_~x~0_22, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1602~0.base, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1601~0.base, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1601~0.offset, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1602~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 21:59:08,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L802-1-->L804: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1602~0.base_11| 1)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1602~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1602~0.base_11|) |v_ULTIMATE.start_main_~#t1602~0.offset_10| 1)) |v_#memory_int_5|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1602~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1602~0.offset_10|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1602~0.base_11| 4) |v_#length_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1602~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t1602~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1602~0.base=|v_ULTIMATE.start_main_~#t1602~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1602~0.offset=|v_ULTIMATE.start_main_~#t1602~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1602~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1602~0.offset] because there is no mapped edge [2019-12-18 21:59:08,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L740: Formula: (and (= ~x$r_buff1_thd1~0_Out667827742 ~x$r_buff0_thd1~0_In667827742) (= 1 ~y~0_Out667827742) (= ~x$r_buff0_thd0~0_In667827742 ~x$r_buff1_thd0~0_Out667827742) (= ~x$r_buff0_thd1~0_Out667827742 1) (= ~x$r_buff0_thd2~0_In667827742 ~x$r_buff1_thd2~0_Out667827742) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In667827742))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In667827742, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In667827742, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In667827742, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In667827742} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In667827742, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out667827742, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In667827742, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out667827742, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out667827742, ~y~0=~y~0_Out667827742, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In667827742, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out667827742} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 21:59:08,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1860575950 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In1860575950 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1860575950|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1860575950 |P0Thread1of1ForFork0_#t~ite5_Out1860575950|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1860575950, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1860575950} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1860575950|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1860575950, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1860575950} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:59:08,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1285999233 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1285999233 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-1285999233 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1285999233 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1285999233|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1285999233| ~x$w_buff1_used~0_In-1285999233)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1285999233, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1285999233, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1285999233, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1285999233} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1285999233|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1285999233, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1285999233, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1285999233, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1285999233} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:59:08,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1626410468 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1626410468 256)))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd1~0_Out1626410468 0)) (and (= ~x$r_buff0_thd1~0_Out1626410468 ~x$r_buff0_thd1~0_In1626410468) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1626410468, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1626410468} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1626410468, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1626410468|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1626410468} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 21:59:08,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1727855459 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1727855459 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-1727855459 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1727855459 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1727855459| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1727855459| ~x$r_buff1_thd1~0_In-1727855459) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1727855459, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1727855459, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1727855459, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1727855459} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1727855459, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1727855459|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1727855459, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1727855459, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1727855459} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:59:08,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L744-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~x$r_buff1_thd1~0_17 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 21:59:08,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~x$r_buff0_thd2~0_53 v_~x$r_buff0_thd2~0_52)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_21, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 21:59:08,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L773-->L773-8: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite29_Out-2050683290| |P1Thread1of1ForFork1_#t~ite30_Out-2050683290|)) (.cse5 (= 0 (mod ~x$w_buff1_used~0_In-2050683290 256))) (.cse4 (= (mod ~x$r_buff1_thd2~0_In-2050683290 256) 0)) (.cse6 (= 0 (mod ~x$r_buff0_thd2~0_In-2050683290 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-2050683290 256) 0)) (.cse1 (= 0 (mod ~weak$$choice2~0_In-2050683290 256)))) (or (let ((.cse3 (not .cse6))) (and (not .cse0) .cse1 .cse2 (= |P1Thread1of1ForFork1_#t~ite28_Out-2050683290| 0) (or .cse3 (not .cse4)) (= |P1Thread1of1ForFork1_#t~ite29_Out-2050683290| |P1Thread1of1ForFork1_#t~ite28_Out-2050683290|) (or .cse3 (not .cse5)))) (and (or (and .cse1 .cse2 (= |P1Thread1of1ForFork1_#t~ite29_Out-2050683290| ~x$r_buff1_thd2~0_In-2050683290) (or (and .cse5 .cse6) (and .cse4 .cse6) .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite29_In-2050683290| |P1Thread1of1ForFork1_#t~ite29_Out-2050683290|) (= ~x$r_buff1_thd2~0_In-2050683290 |P1Thread1of1ForFork1_#t~ite30_Out-2050683290|) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite28_In-2050683290| |P1Thread1of1ForFork1_#t~ite28_Out-2050683290|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-2050683290|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2050683290, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2050683290, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2050683290, ~weak$$choice2~0=~weak$$choice2~0_In-2050683290, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-2050683290|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2050683290} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2050683290|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-2050683290|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2050683290, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2050683290, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2050683290, ~weak$$choice2~0=~weak$$choice2~0_In-2050683290, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-2050683290|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2050683290} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 21:59:08,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= v_~x$mem_tmp~0_4 v_~x~0_16) (= 0 v_~x$flush_delayed~0_6) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-18 21:59:08,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-460796682 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-460796682 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-460796682 |P1Thread1of1ForFork1_#t~ite32_Out-460796682|)) (and (or .cse0 .cse1) (= ~x~0_In-460796682 |P1Thread1of1ForFork1_#t~ite32_Out-460796682|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-460796682, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-460796682, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-460796682, ~x~0=~x~0_In-460796682} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-460796682, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-460796682, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-460796682, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-460796682|, ~x~0=~x~0_In-460796682} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 21:59:08,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~x~0_17 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 21:59:08,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1935061324 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1935061324 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1935061324|) (not .cse1)) (and (= ~x$w_buff0_used~0_In1935061324 |P1Thread1of1ForFork1_#t~ite34_Out1935061324|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1935061324, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1935061324} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1935061324|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1935061324, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1935061324} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 21:59:08,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1909330722 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1909330722 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1909330722 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1909330722 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1909330722|)) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1909330722 |P1Thread1of1ForFork1_#t~ite35_Out1909330722|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1909330722, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1909330722, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1909330722, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1909330722} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1909330722, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1909330722, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1909330722|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1909330722, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1909330722} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 21:59:08,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1220971812 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1220971812 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1220971812|) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1220971812| ~x$r_buff0_thd2~0_In-1220971812)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1220971812, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1220971812} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1220971812, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1220971812|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1220971812} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 21:59:08,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1664959203 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-1664959203 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1664959203 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1664959203 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-1664959203 |P1Thread1of1ForFork1_#t~ite37_Out-1664959203|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1664959203|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1664959203, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1664959203, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1664959203, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1664959203} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1664959203, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1664959203, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1664959203, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1664959203|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1664959203} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:59:08,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_41 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_41, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:59:08,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L804-1-->L810: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 21:59:08,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite41_Out221202062| |ULTIMATE.start_main_#t~ite40_Out221202062|)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In221202062 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In221202062 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= ~x$w_buff1~0_In221202062 |ULTIMATE.start_main_#t~ite40_Out221202062|)) (and .cse0 (or .cse1 .cse2) (= ~x~0_In221202062 |ULTIMATE.start_main_#t~ite40_Out221202062|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In221202062, ~x$w_buff1_used~0=~x$w_buff1_used~0_In221202062, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In221202062, ~x~0=~x~0_In221202062} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out221202062|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out221202062|, ~x$w_buff1~0=~x$w_buff1~0_In221202062, ~x$w_buff1_used~0=~x$w_buff1_used~0_In221202062, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In221202062, ~x~0=~x~0_In221202062} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:59:08,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In2124821985 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2124821985 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out2124821985| ~x$w_buff0_used~0_In2124821985)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out2124821985| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2124821985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2124821985} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2124821985, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2124821985|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2124821985} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:59:08,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-471241727 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-471241727 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-471241727 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-471241727 256) 0))) (or (and (= ~x$w_buff1_used~0_In-471241727 |ULTIMATE.start_main_#t~ite43_Out-471241727|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-471241727|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-471241727, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-471241727, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-471241727, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-471241727} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-471241727, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-471241727, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-471241727|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-471241727, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-471241727} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 21:59:08,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-701113500 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-701113500 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-701113500|) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-701113500 |ULTIMATE.start_main_#t~ite44_Out-701113500|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-701113500, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-701113500} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-701113500, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-701113500|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-701113500} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:59:08,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1360874274 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-1360874274 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1360874274 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1360874274 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1360874274|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In-1360874274 |ULTIMATE.start_main_#t~ite45_Out-1360874274|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1360874274, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1360874274, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1360874274, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1360874274} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1360874274, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1360874274, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1360874274, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1360874274|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1360874274} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 21:59:08,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p1_EAX~0_7) (= v_~y~0_10 2) (= v_~main$tmp_guard1~0_8 0) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite45_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= 0 v_~__unbuffered_p1_EBX~0_7) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:59:08,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:59:08 BasicIcfg [2019-12-18 21:59:08,823 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:59:08,825 INFO L168 Benchmark]: Toolchain (without parser) took 10450.58 ms. Allocated memory was 137.9 MB in the beginning and 369.1 MB in the end (delta: 231.2 MB). Free memory was 97.4 MB in the beginning and 156.3 MB in the end (delta: -58.8 MB). Peak memory consumption was 172.4 MB. Max. memory is 7.1 GB. [2019-12-18 21:59:08,826 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 137.9 MB. Free memory was 117.5 MB in the beginning and 117.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 21:59:08,827 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.55 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 97.0 MB in the beginning and 155.2 MB in the end (delta: -58.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:59:08,827 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.82 ms. Allocated memory is still 200.8 MB. Free memory was 155.2 MB in the beginning and 153.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:59:08,828 INFO L168 Benchmark]: Boogie Preprocessor took 39.43 ms. Allocated memory is still 200.8 MB. Free memory was 153.1 MB in the beginning and 151.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:59:08,829 INFO L168 Benchmark]: RCFGBuilder took 804.15 ms. Allocated memory is still 200.8 MB. Free memory was 151.0 MB in the beginning and 106.3 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:59:08,830 INFO L168 Benchmark]: TraceAbstraction took 8753.08 ms. Allocated memory was 200.8 MB in the beginning and 369.1 MB in the end (delta: 168.3 MB). Free memory was 105.6 MB in the beginning and 156.3 MB in the end (delta: -50.7 MB). Peak memory consumption was 117.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:59:08,834 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 137.9 MB. Free memory was 117.5 MB in the beginning and 117.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.55 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 97.0 MB in the beginning and 155.2 MB in the end (delta: -58.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.82 ms. Allocated memory is still 200.8 MB. Free memory was 155.2 MB in the beginning and 153.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.43 ms. Allocated memory is still 200.8 MB. Free memory was 153.1 MB in the beginning and 151.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 804.15 ms. Allocated memory is still 200.8 MB. Free memory was 151.0 MB in the beginning and 106.3 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8753.08 ms. Allocated memory was 200.8 MB in the beginning and 369.1 MB in the end (delta: 168.3 MB). Free memory was 105.6 MB in the beginning and 156.3 MB in the end (delta: -50.7 MB). Peak memory consumption was 117.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 148 ProgramPointsBefore, 76 ProgramPointsAfterwards, 182 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 26 ChoiceCompositions, 4391 VarBasedMoverChecksPositive, 152 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49085 CheckedPairsTotal, 102 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, z=0] [L726] 1 x$w_buff1 = x$w_buff0 [L727] 1 x$w_buff0 = 1 [L728] 1 x$w_buff1_used = x$w_buff0_used [L729] 1 x$w_buff0_used = (_Bool)1 [L804] FCALL, FORK 0 pthread_create(&t1602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L740] 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_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=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, z=0] [L754] 2 y = 2 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 x$flush_delayed = weak$$choice2 [L766] 2 x$mem_tmp = x VAL [__unbuffered_cnt=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=2, z=1] [L767] 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_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=2, z=1] [L740] 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) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 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 [L767] 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) [L768] 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=1, __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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L768] 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)) [L769] 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=1, __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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L769] 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)) [L770] 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=1, __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))=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L770] 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)) [L771] 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=1, __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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L771] 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)) [L773] 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)) [L774] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L779] 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=1, __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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 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 [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L810] 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_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=2, z=1] [L810] 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) [L811] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 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 [L813] 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, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.4s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1432 SDtfs, 901 SDslu, 2082 SDs, 0 SdLazy, 845 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8066occurred 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: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 2328 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 416 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 350 ConstructedInterpolants, 0 QuantifiedInterpolants, 32448 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...