/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/mix028_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:05:16,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:05:16,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:05:16,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:05:16,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:05:16,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:05:16,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:05:16,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:05:16,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:05:16,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:05:16,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:05:16,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:05:16,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:05:16,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:05:16,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:05:16,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:05:16,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:05:16,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:05:16,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:05:16,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:05:16,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:05:16,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:05:16,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:05:16,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:05:16,138 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:05:16,138 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:05:16,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:05:16,140 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:05:16,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:05:16,144 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:05:16,144 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:05:16,145 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:05:16,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:05:16,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:05:16,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:05:16,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:05:16,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:05:16,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:05:16,152 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:05:16,153 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:05:16,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:05:16,154 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:05:16,168 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:05:16,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:05:16,170 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:05:16,170 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:05:16,170 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:05:16,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:05:16,171 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:05:16,171 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:05:16,171 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:05:16,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:05:16,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:05:16,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:05:16,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:05:16,172 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:05:16,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:05:16,172 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:05:16,173 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:05:16,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:05:16,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:05:16,173 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:05:16,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:05:16,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:05:16,174 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:05:16,174 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:05:16,174 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:05:16,174 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:05:16,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:05:16,175 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:05:16,175 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:05:16,175 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:05:16,471 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:05:16,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:05:16,489 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:05:16,490 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:05:16,491 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:05:16,491 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i [2019-12-27 06:05:16,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1f5bfea/214b0de0ff6c4bb0b654cb8541d6f7ee/FLAGe3835cf20 [2019-12-27 06:05:17,065 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:05:17,066 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i [2019-12-27 06:05:17,092 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1f5bfea/214b0de0ff6c4bb0b654cb8541d6f7ee/FLAGe3835cf20 [2019-12-27 06:05:17,392 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1f5bfea/214b0de0ff6c4bb0b654cb8541d6f7ee [2019-12-27 06:05:17,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:05:17,403 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:05:17,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:05:17,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:05:17,409 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:05:17,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:05:17" (1/1) ... [2019-12-27 06:05:17,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdaac8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:17, skipping insertion in model container [2019-12-27 06:05:17,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:05:17" (1/1) ... [2019-12-27 06:05:17,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:05:17,483 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:05:18,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:05:18,072 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:05:18,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:05:18,233 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:05:18,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:18 WrapperNode [2019-12-27 06:05:18,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:05:18,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:05:18,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:05:18,235 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:05:18,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:18" (1/1) ... [2019-12-27 06:05:18,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:18" (1/1) ... [2019-12-27 06:05:18,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:05:18,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:05:18,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:05:18,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:05:18,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:18" (1/1) ... [2019-12-27 06:05:18,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:18" (1/1) ... [2019-12-27 06:05:18,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:18" (1/1) ... [2019-12-27 06:05:18,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:18" (1/1) ... [2019-12-27 06:05:18,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:18" (1/1) ... [2019-12-27 06:05:18,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:18" (1/1) ... [2019-12-27 06:05:18,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:18" (1/1) ... [2019-12-27 06:05:18,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:05:18,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:05:18,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:05:18,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:05:18,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:05:18,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:05:18,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:05:18,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:05:18,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:05:18,447 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:05:18,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:05:18,448 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:05:18,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:05:18,448 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:05:18,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:05:18,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:05:18,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:05:18,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:05:18,452 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:05:19,367 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:05:19,367 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:05:19,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:05:19 BoogieIcfgContainer [2019-12-27 06:05:19,369 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:05:19,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:05:19,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:05:19,391 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:05:19,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:05:17" (1/3) ... [2019-12-27 06:05:19,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ddbb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:05:19, skipping insertion in model container [2019-12-27 06:05:19,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:18" (2/3) ... [2019-12-27 06:05:19,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ddbb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:05:19, skipping insertion in model container [2019-12-27 06:05:19,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:05:19" (3/3) ... [2019-12-27 06:05:19,398 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_tso.opt.i [2019-12-27 06:05:19,408 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:05:19,409 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:05:19,421 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:05:19,422 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:05:19,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,459 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,460 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,461 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,462 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,469 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,469 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,470 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,470 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,470 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,497 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,498 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,503 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,504 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,506 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,512 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,513 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:05:19,527 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:05:19,546 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:05:19,547 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:05:19,547 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:05:19,547 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:05:19,547 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:05:19,547 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:05:19,547 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:05:19,547 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:05:19,565 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 257 transitions [2019-12-27 06:05:19,567 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 205 places, 257 transitions [2019-12-27 06:05:19,695 INFO L132 PetriNetUnfolder]: 62/254 cut-off events. [2019-12-27 06:05:19,695 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:05:19,717 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 254 events. 62/254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 519 event pairs. 0/190 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-27 06:05:19,752 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 205 places, 257 transitions [2019-12-27 06:05:19,819 INFO L132 PetriNetUnfolder]: 62/254 cut-off events. [2019-12-27 06:05:19,819 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:05:19,830 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 254 events. 62/254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 519 event pairs. 0/190 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-27 06:05:19,866 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26988 [2019-12-27 06:05:19,867 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:05:23,500 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 06:05:23,629 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 06:05:23,731 INFO L206 etLargeBlockEncoding]: Checked pairs total: 170994 [2019-12-27 06:05:23,731 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-27 06:05:23,735 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 122 places, 145 transitions [2019-12-27 06:05:28,972 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 59962 states. [2019-12-27 06:05:28,974 INFO L276 IsEmpty]: Start isEmpty. Operand 59962 states. [2019-12-27 06:05:28,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 06:05:28,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:28,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:28,989 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:28,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:28,997 INFO L82 PathProgramCache]: Analyzing trace with hash -211659802, now seen corresponding path program 1 times [2019-12-27 06:05:29,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:29,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401214969] [2019-12-27 06:05:29,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:29,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:29,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401214969] [2019-12-27 06:05:29,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:29,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:05:29,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148817087] [2019-12-27 06:05:29,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:05:29,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:29,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:05:29,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:05:29,271 INFO L87 Difference]: Start difference. First operand 59962 states. Second operand 3 states. [2019-12-27 06:05:30,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:30,328 INFO L93 Difference]: Finished difference Result 59782 states and 240290 transitions. [2019-12-27 06:05:30,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:05:30,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 06:05:30,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:30,803 INFO L225 Difference]: With dead ends: 59782 [2019-12-27 06:05:30,803 INFO L226 Difference]: Without dead ends: 58586 [2019-12-27 06:05:30,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:05:33,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58586 states. [2019-12-27 06:05:35,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58586 to 58586. [2019-12-27 06:05:35,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58586 states. [2019-12-27 06:05:35,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58586 states to 58586 states and 235740 transitions. [2019-12-27 06:05:35,797 INFO L78 Accepts]: Start accepts. Automaton has 58586 states and 235740 transitions. Word has length 7 [2019-12-27 06:05:35,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:35,798 INFO L462 AbstractCegarLoop]: Abstraction has 58586 states and 235740 transitions. [2019-12-27 06:05:35,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:05:35,798 INFO L276 IsEmpty]: Start isEmpty. Operand 58586 states and 235740 transitions. [2019-12-27 06:05:35,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:05:35,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:35,803 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:35,803 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:35,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:35,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1955894819, now seen corresponding path program 1 times [2019-12-27 06:05:35,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:35,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996541153] [2019-12-27 06:05:35,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:35,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996541153] [2019-12-27 06:05:35,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:35,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:05:35,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805129766] [2019-12-27 06:05:35,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:05:35,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:35,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:05:35,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:05:35,956 INFO L87 Difference]: Start difference. First operand 58586 states and 235740 transitions. Second operand 4 states. [2019-12-27 06:05:39,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:39,144 INFO L93 Difference]: Finished difference Result 94168 states and 363659 transitions. [2019-12-27 06:05:39,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:05:39,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 06:05:39,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:39,613 INFO L225 Difference]: With dead ends: 94168 [2019-12-27 06:05:39,613 INFO L226 Difference]: Without dead ends: 94154 [2019-12-27 06:05:39,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:05:41,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94154 states. [2019-12-27 06:05:45,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94154 to 90710. [2019-12-27 06:05:45,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90710 states. [2019-12-27 06:05:46,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90710 states to 90710 states and 352628 transitions. [2019-12-27 06:05:46,158 INFO L78 Accepts]: Start accepts. Automaton has 90710 states and 352628 transitions. Word has length 13 [2019-12-27 06:05:46,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:46,159 INFO L462 AbstractCegarLoop]: Abstraction has 90710 states and 352628 transitions. [2019-12-27 06:05:46,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:05:46,159 INFO L276 IsEmpty]: Start isEmpty. Operand 90710 states and 352628 transitions. [2019-12-27 06:05:46,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:05:46,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:46,162 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:46,162 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:46,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:46,162 INFO L82 PathProgramCache]: Analyzing trace with hash -380053055, now seen corresponding path program 1 times [2019-12-27 06:05:46,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:46,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550002651] [2019-12-27 06:05:46,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:46,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:46,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550002651] [2019-12-27 06:05:46,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:46,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:05:46,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8941239] [2019-12-27 06:05:46,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:05:46,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:46,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:05:46,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:05:46,227 INFO L87 Difference]: Start difference. First operand 90710 states and 352628 transitions. Second operand 3 states. [2019-12-27 06:05:46,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:46,407 INFO L93 Difference]: Finished difference Result 49511 states and 167787 transitions. [2019-12-27 06:05:46,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:05:46,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:05:46,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:46,661 INFO L225 Difference]: With dead ends: 49511 [2019-12-27 06:05:46,661 INFO L226 Difference]: Without dead ends: 49511 [2019-12-27 06:05:46,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:05:48,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49511 states. [2019-12-27 06:05:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49511 to 49511. [2019-12-27 06:05:48,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49511 states. [2019-12-27 06:05:48,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49511 states to 49511 states and 167787 transitions. [2019-12-27 06:05:48,681 INFO L78 Accepts]: Start accepts. Automaton has 49511 states and 167787 transitions. Word has length 13 [2019-12-27 06:05:48,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:48,681 INFO L462 AbstractCegarLoop]: Abstraction has 49511 states and 167787 transitions. [2019-12-27 06:05:48,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:05:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 49511 states and 167787 transitions. [2019-12-27 06:05:48,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:05:48,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:48,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:48,683 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:48,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:48,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1312328818, now seen corresponding path program 1 times [2019-12-27 06:05:48,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:48,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211932065] [2019-12-27 06:05:48,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:48,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211932065] [2019-12-27 06:05:48,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:48,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:05:48,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611113466] [2019-12-27 06:05:48,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:05:48,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:48,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:05:48,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:05:48,759 INFO L87 Difference]: Start difference. First operand 49511 states and 167787 transitions. Second operand 4 states. [2019-12-27 06:05:48,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:48,795 INFO L93 Difference]: Finished difference Result 5190 states and 13229 transitions. [2019-12-27 06:05:48,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:05:48,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 06:05:48,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:48,804 INFO L225 Difference]: With dead ends: 5190 [2019-12-27 06:05:48,804 INFO L226 Difference]: Without dead ends: 5190 [2019-12-27 06:05:48,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:05:48,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2019-12-27 06:05:48,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 5190. [2019-12-27 06:05:48,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5190 states. [2019-12-27 06:05:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 13229 transitions. [2019-12-27 06:05:48,884 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 13229 transitions. Word has length 14 [2019-12-27 06:05:48,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:48,884 INFO L462 AbstractCegarLoop]: Abstraction has 5190 states and 13229 transitions. [2019-12-27 06:05:48,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:05:48,884 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 13229 transitions. [2019-12-27 06:05:48,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 06:05:48,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:48,888 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:48,889 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:48,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:48,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1825338, now seen corresponding path program 1 times [2019-12-27 06:05:48,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:48,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300294181] [2019-12-27 06:05:48,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:48,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:48,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300294181] [2019-12-27 06:05:48,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:48,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:05:48,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361275824] [2019-12-27 06:05:48,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:05:48,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:48,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:05:48,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:05:48,970 INFO L87 Difference]: Start difference. First operand 5190 states and 13229 transitions. Second operand 5 states. [2019-12-27 06:05:48,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:48,999 INFO L93 Difference]: Finished difference Result 2021 states and 5327 transitions. [2019-12-27 06:05:49,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:05:49,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 06:05:49,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:49,003 INFO L225 Difference]: With dead ends: 2021 [2019-12-27 06:05:49,003 INFO L226 Difference]: Without dead ends: 2021 [2019-12-27 06:05:49,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:05:49,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2019-12-27 06:05:49,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 1923. [2019-12-27 06:05:49,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1923 states. [2019-12-27 06:05:49,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 5096 transitions. [2019-12-27 06:05:49,621 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 5096 transitions. Word has length 26 [2019-12-27 06:05:49,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:49,621 INFO L462 AbstractCegarLoop]: Abstraction has 1923 states and 5096 transitions. [2019-12-27 06:05:49,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:05:49,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 5096 transitions. [2019-12-27 06:05:49,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 06:05:49,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:49,630 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:49,631 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:49,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:49,633 INFO L82 PathProgramCache]: Analyzing trace with hash -285304999, now seen corresponding path program 1 times [2019-12-27 06:05:49,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:49,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679789000] [2019-12-27 06:05:49,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:49,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679789000] [2019-12-27 06:05:49,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:49,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:05:49,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328370005] [2019-12-27 06:05:49,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:05:49,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:49,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:05:49,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:05:49,805 INFO L87 Difference]: Start difference. First operand 1923 states and 5096 transitions. Second operand 3 states. [2019-12-27 06:05:49,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:49,823 INFO L93 Difference]: Finished difference Result 1923 states and 5006 transitions. [2019-12-27 06:05:49,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:05:49,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-27 06:05:49,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:49,826 INFO L225 Difference]: With dead ends: 1923 [2019-12-27 06:05:49,827 INFO L226 Difference]: Without dead ends: 1923 [2019-12-27 06:05:49,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:05:49,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2019-12-27 06:05:49,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1923. [2019-12-27 06:05:49,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1923 states. [2019-12-27 06:05:49,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 5006 transitions. [2019-12-27 06:05:49,858 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 5006 transitions. Word has length 71 [2019-12-27 06:05:49,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:49,858 INFO L462 AbstractCegarLoop]: Abstraction has 1923 states and 5006 transitions. [2019-12-27 06:05:49,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:05:49,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 5006 transitions. [2019-12-27 06:05:49,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 06:05:49,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:49,864 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:49,864 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:49,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:49,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1404202995, now seen corresponding path program 1 times [2019-12-27 06:05:49,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:49,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509391084] [2019-12-27 06:05:49,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:50,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509391084] [2019-12-27 06:05:50,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:50,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:05:50,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711928563] [2019-12-27 06:05:50,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:05:50,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:50,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:05:50,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:05:50,018 INFO L87 Difference]: Start difference. First operand 1923 states and 5006 transitions. Second operand 5 states. [2019-12-27 06:05:50,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:50,273 INFO L93 Difference]: Finished difference Result 2180 states and 5594 transitions. [2019-12-27 06:05:50,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:05:50,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-12-27 06:05:50,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:50,276 INFO L225 Difference]: With dead ends: 2180 [2019-12-27 06:05:50,276 INFO L226 Difference]: Without dead ends: 2180 [2019-12-27 06:05:50,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:05:50,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2019-12-27 06:05:50,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 1993. [2019-12-27 06:05:50,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2019-12-27 06:05:50,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 5175 transitions. [2019-12-27 06:05:50,306 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 5175 transitions. Word has length 72 [2019-12-27 06:05:50,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:50,306 INFO L462 AbstractCegarLoop]: Abstraction has 1993 states and 5175 transitions. [2019-12-27 06:05:50,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:05:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 5175 transitions. [2019-12-27 06:05:50,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 06:05:50,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:50,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:50,313 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:50,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:50,313 INFO L82 PathProgramCache]: Analyzing trace with hash 247016729, now seen corresponding path program 2 times [2019-12-27 06:05:50,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:50,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782268383] [2019-12-27 06:05:50,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:50,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:50,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782268383] [2019-12-27 06:05:50,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:50,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:05:50,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750298057] [2019-12-27 06:05:50,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:05:50,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:50,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:05:50,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:05:50,425 INFO L87 Difference]: Start difference. First operand 1993 states and 5175 transitions. Second operand 3 states. [2019-12-27 06:05:50,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:50,495 INFO L93 Difference]: Finished difference Result 1992 states and 5173 transitions. [2019-12-27 06:05:50,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:05:50,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-27 06:05:50,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:50,500 INFO L225 Difference]: With dead ends: 1992 [2019-12-27 06:05:50,500 INFO L226 Difference]: Without dead ends: 1992 [2019-12-27 06:05:50,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:05:50,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2019-12-27 06:05:50,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1815. [2019-12-27 06:05:50,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1815 states. [2019-12-27 06:05:50,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 4765 transitions. [2019-12-27 06:05:50,545 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 4765 transitions. Word has length 72 [2019-12-27 06:05:50,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:50,545 INFO L462 AbstractCegarLoop]: Abstraction has 1815 states and 4765 transitions. [2019-12-27 06:05:50,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:05:50,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 4765 transitions. [2019-12-27 06:05:50,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 06:05:50,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:50,553 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:50,553 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:50,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:50,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1630724456, now seen corresponding path program 1 times [2019-12-27 06:05:50,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:50,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750608924] [2019-12-27 06:05:50,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:50,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:50,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750608924] [2019-12-27 06:05:50,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:50,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:05:50,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634527702] [2019-12-27 06:05:50,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:05:50,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:50,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:05:50,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:05:50,660 INFO L87 Difference]: Start difference. First operand 1815 states and 4765 transitions. Second operand 4 states. [2019-12-27 06:05:50,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:50,845 INFO L93 Difference]: Finished difference Result 2067 states and 5345 transitions. [2019-12-27 06:05:50,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:05:50,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-27 06:05:50,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:50,849 INFO L225 Difference]: With dead ends: 2067 [2019-12-27 06:05:50,850 INFO L226 Difference]: Without dead ends: 2067 [2019-12-27 06:05:50,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:05:50,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2019-12-27 06:05:50,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2039. [2019-12-27 06:05:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2019-12-27 06:05:50,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 5279 transitions. [2019-12-27 06:05:50,882 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 5279 transitions. Word has length 73 [2019-12-27 06:05:50,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:50,882 INFO L462 AbstractCegarLoop]: Abstraction has 2039 states and 5279 transitions. [2019-12-27 06:05:50,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:05:50,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 5279 transitions. [2019-12-27 06:05:50,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 06:05:50,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:50,887 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:50,888 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:50,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:50,888 INFO L82 PathProgramCache]: Analyzing trace with hash 613964530, now seen corresponding path program 2 times [2019-12-27 06:05:50,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:50,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036495242] [2019-12-27 06:05:50,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:51,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-27 06:05:51,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036495242] [2019-12-27 06:05:51,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:51,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:05:51,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013300225] [2019-12-27 06:05:51,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:05:51,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:51,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:05:51,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:05:51,040 INFO L87 Difference]: Start difference. First operand 2039 states and 5279 transitions. Second operand 6 states. [2019-12-27 06:05:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:51,421 INFO L93 Difference]: Finished difference Result 3042 states and 7816 transitions. [2019-12-27 06:05:51,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:05:51,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-12-27 06:05:51,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:51,426 INFO L225 Difference]: With dead ends: 3042 [2019-12-27 06:05:51,427 INFO L226 Difference]: Without dead ends: 3042 [2019-12-27 06:05:51,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:05:51,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2019-12-27 06:05:51,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2415. [2019-12-27 06:05:51,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2415 states. [2019-12-27 06:05:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 6269 transitions. [2019-12-27 06:05:51,470 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 6269 transitions. Word has length 73 [2019-12-27 06:05:51,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:51,470 INFO L462 AbstractCegarLoop]: Abstraction has 2415 states and 6269 transitions. [2019-12-27 06:05:51,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:05:51,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 6269 transitions. [2019-12-27 06:05:51,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 06:05:51,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:51,475 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:51,476 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:51,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:51,476 INFO L82 PathProgramCache]: Analyzing trace with hash -25616324, now seen corresponding path program 3 times [2019-12-27 06:05:51,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:51,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384194919] [2019-12-27 06:05:51,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:51,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:51,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384194919] [2019-12-27 06:05:51,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:51,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:05:51,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127659154] [2019-12-27 06:05:51,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:05:51,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:51,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:05:51,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:05:51,650 INFO L87 Difference]: Start difference. First operand 2415 states and 6269 transitions. Second operand 7 states. [2019-12-27 06:05:52,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:52,193 INFO L93 Difference]: Finished difference Result 3580 states and 9241 transitions. [2019-12-27 06:05:52,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 06:05:52,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-27 06:05:52,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:52,199 INFO L225 Difference]: With dead ends: 3580 [2019-12-27 06:05:52,199 INFO L226 Difference]: Without dead ends: 3580 [2019-12-27 06:05:52,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:05:52,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3580 states. [2019-12-27 06:05:52,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3580 to 2421. [2019-12-27 06:05:52,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2421 states. [2019-12-27 06:05:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 6284 transitions. [2019-12-27 06:05:52,234 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 6284 transitions. Word has length 73 [2019-12-27 06:05:52,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:52,234 INFO L462 AbstractCegarLoop]: Abstraction has 2421 states and 6284 transitions. [2019-12-27 06:05:52,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:05:52,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 6284 transitions. [2019-12-27 06:05:52,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 06:05:52,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:52,239 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:52,240 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:52,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:52,240 INFO L82 PathProgramCache]: Analyzing trace with hash -412461650, now seen corresponding path program 4 times [2019-12-27 06:05:52,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:52,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105024931] [2019-12-27 06:05:52,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:52,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105024931] [2019-12-27 06:05:52,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:52,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:05:52,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947326581] [2019-12-27 06:05:52,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:05:52,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:52,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:05:52,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:05:52,517 INFO L87 Difference]: Start difference. First operand 2421 states and 6284 transitions. Second operand 8 states. [2019-12-27 06:05:53,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:53,043 INFO L93 Difference]: Finished difference Result 3203 states and 8207 transitions. [2019-12-27 06:05:53,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:05:53,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2019-12-27 06:05:53,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:53,048 INFO L225 Difference]: With dead ends: 3203 [2019-12-27 06:05:53,048 INFO L226 Difference]: Without dead ends: 3203 [2019-12-27 06:05:53,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:05:53,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3203 states. [2019-12-27 06:05:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3203 to 2159. [2019-12-27 06:05:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2159 states. [2019-12-27 06:05:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 5549 transitions. [2019-12-27 06:05:53,076 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 5549 transitions. Word has length 73 [2019-12-27 06:05:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:53,076 INFO L462 AbstractCegarLoop]: Abstraction has 2159 states and 5549 transitions. [2019-12-27 06:05:53,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:05:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 5549 transitions. [2019-12-27 06:05:53,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 06:05:53,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:53,080 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:53,081 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:53,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:53,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1389200384, now seen corresponding path program 5 times [2019-12-27 06:05:53,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:53,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621001503] [2019-12-27 06:05:53,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:53,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621001503] [2019-12-27 06:05:53,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:53,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:05:53,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006337750] [2019-12-27 06:05:53,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:05:53,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:53,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:05:53,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:05:53,253 INFO L87 Difference]: Start difference. First operand 2159 states and 5549 transitions. Second operand 6 states. [2019-12-27 06:05:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:53,600 INFO L93 Difference]: Finished difference Result 3346 states and 8570 transitions. [2019-12-27 06:05:53,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:05:53,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-12-27 06:05:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:53,606 INFO L225 Difference]: With dead ends: 3346 [2019-12-27 06:05:53,606 INFO L226 Difference]: Without dead ends: 3346 [2019-12-27 06:05:53,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:05:53,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2019-12-27 06:05:53,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2167. [2019-12-27 06:05:53,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2167 states. [2019-12-27 06:05:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 5569 transitions. [2019-12-27 06:05:53,634 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 5569 transitions. Word has length 73 [2019-12-27 06:05:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:53,635 INFO L462 AbstractCegarLoop]: Abstraction has 2167 states and 5569 transitions. [2019-12-27 06:05:53,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:05:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 5569 transitions. [2019-12-27 06:05:53,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 06:05:53,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:53,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:53,639 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:53,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:53,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1227873658, now seen corresponding path program 6 times [2019-12-27 06:05:53,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:53,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106945018] [2019-12-27 06:05:53,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:53,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106945018] [2019-12-27 06:05:53,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:53,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:05:53,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379389969] [2019-12-27 06:05:53,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:05:53,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:53,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:05:53,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:05:53,837 INFO L87 Difference]: Start difference. First operand 2167 states and 5569 transitions. Second operand 8 states. [2019-12-27 06:05:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:54,326 INFO L93 Difference]: Finished difference Result 2520 states and 6409 transitions. [2019-12-27 06:05:54,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:05:54,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2019-12-27 06:05:54,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:54,330 INFO L225 Difference]: With dead ends: 2520 [2019-12-27 06:05:54,331 INFO L226 Difference]: Without dead ends: 2520 [2019-12-27 06:05:54,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:05:54,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2019-12-27 06:05:54,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 2055. [2019-12-27 06:05:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2019-12-27 06:05:54,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 5279 transitions. [2019-12-27 06:05:54,355 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 5279 transitions. Word has length 73 [2019-12-27 06:05:54,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:54,356 INFO L462 AbstractCegarLoop]: Abstraction has 2055 states and 5279 transitions. [2019-12-27 06:05:54,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:05:54,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 5279 transitions. [2019-12-27 06:05:54,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 06:05:54,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:54,360 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:54,360 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:54,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:54,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1282272910, now seen corresponding path program 7 times [2019-12-27 06:05:54,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:54,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249680346] [2019-12-27 06:05:54,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:54,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249680346] [2019-12-27 06:05:54,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:54,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:05:54,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062611291] [2019-12-27 06:05:54,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:05:54,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:54,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:05:54,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:05:54,564 INFO L87 Difference]: Start difference. First operand 2055 states and 5279 transitions. Second operand 8 states. [2019-12-27 06:05:55,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:55,007 INFO L93 Difference]: Finished difference Result 2446 states and 6224 transitions. [2019-12-27 06:05:55,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:05:55,007 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2019-12-27 06:05:55,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:55,011 INFO L225 Difference]: With dead ends: 2446 [2019-12-27 06:05:55,011 INFO L226 Difference]: Without dead ends: 2446 [2019-12-27 06:05:55,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:05:55,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2019-12-27 06:05:55,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2083. [2019-12-27 06:05:55,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2083 states. [2019-12-27 06:05:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 5345 transitions. [2019-12-27 06:05:55,049 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 5345 transitions. Word has length 73 [2019-12-27 06:05:55,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:55,049 INFO L462 AbstractCegarLoop]: Abstraction has 2083 states and 5345 transitions. [2019-12-27 06:05:55,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:05:55,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 5345 transitions. [2019-12-27 06:05:55,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 06:05:55,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:55,054 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:55,054 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:55,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:55,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1809443492, now seen corresponding path program 1 times [2019-12-27 06:05:55,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:55,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973431374] [2019-12-27 06:05:55,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:55,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:55,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973431374] [2019-12-27 06:05:55,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:55,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:05:55,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206694164] [2019-12-27 06:05:55,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:05:55,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:55,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:05:55,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:05:55,184 INFO L87 Difference]: Start difference. First operand 2083 states and 5345 transitions. Second operand 6 states. [2019-12-27 06:05:55,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:55,320 INFO L93 Difference]: Finished difference Result 3381 states and 8141 transitions. [2019-12-27 06:05:55,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:05:55,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-12-27 06:05:55,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:55,323 INFO L225 Difference]: With dead ends: 3381 [2019-12-27 06:05:55,323 INFO L226 Difference]: Without dead ends: 1503 [2019-12-27 06:05:55,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:05:55,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-12-27 06:05:55,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1237. [2019-12-27 06:05:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-12-27 06:05:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2697 transitions. [2019-12-27 06:05:55,343 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2697 transitions. Word has length 74 [2019-12-27 06:05:55,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:55,343 INFO L462 AbstractCegarLoop]: Abstraction has 1237 states and 2697 transitions. [2019-12-27 06:05:55,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:05:55,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2697 transitions. [2019-12-27 06:05:55,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 06:05:55,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:55,346 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:55,346 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:55,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:55,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1804184334, now seen corresponding path program 2 times [2019-12-27 06:05:55,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:55,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529249400] [2019-12-27 06:05:55,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:55,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529249400] [2019-12-27 06:05:55,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:55,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:05:55,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101351318] [2019-12-27 06:05:55,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:05:55,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:55,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:05:55,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:05:55,476 INFO L87 Difference]: Start difference. First operand 1237 states and 2697 transitions. Second operand 5 states. [2019-12-27 06:05:55,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:55,542 INFO L93 Difference]: Finished difference Result 1572 states and 3383 transitions. [2019-12-27 06:05:55,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:05:55,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-12-27 06:05:55,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:55,543 INFO L225 Difference]: With dead ends: 1572 [2019-12-27 06:05:55,543 INFO L226 Difference]: Without dead ends: 277 [2019-12-27 06:05:55,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:05:55,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-12-27 06:05:55,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 253. [2019-12-27 06:05:55,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-12-27 06:05:55,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 430 transitions. [2019-12-27 06:05:55,548 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 430 transitions. Word has length 74 [2019-12-27 06:05:55,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:55,548 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 430 transitions. [2019-12-27 06:05:55,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:05:55,548 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 430 transitions. [2019-12-27 06:05:55,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 06:05:55,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:55,549 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:55,549 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:55,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:55,550 INFO L82 PathProgramCache]: Analyzing trace with hash 53493272, now seen corresponding path program 3 times [2019-12-27 06:05:55,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:55,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207530407] [2019-12-27 06:05:55,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:56,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:56,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207530407] [2019-12-27 06:05:56,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:56,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:05:56,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527429813] [2019-12-27 06:05:56,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:05:56,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:56,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:05:56,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:05:56,062 INFO L87 Difference]: Start difference. First operand 253 states and 430 transitions. Second operand 15 states. [2019-12-27 06:05:56,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:56,900 INFO L93 Difference]: Finished difference Result 543 states and 956 transitions. [2019-12-27 06:05:56,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:05:56,900 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 74 [2019-12-27 06:05:56,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:56,901 INFO L225 Difference]: With dead ends: 543 [2019-12-27 06:05:56,901 INFO L226 Difference]: Without dead ends: 513 [2019-12-27 06:05:56,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 06:05:56,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-12-27 06:05:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 391. [2019-12-27 06:05:56,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-12-27 06:05:56,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 676 transitions. [2019-12-27 06:05:56,907 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 676 transitions. Word has length 74 [2019-12-27 06:05:56,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:56,908 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 676 transitions. [2019-12-27 06:05:56,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:05:56,908 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 676 transitions. [2019-12-27 06:05:56,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 06:05:56,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:56,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:56,909 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:56,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:56,910 INFO L82 PathProgramCache]: Analyzing trace with hash 328981008, now seen corresponding path program 4 times [2019-12-27 06:05:56,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:56,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753706081] [2019-12-27 06:05:56,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:57,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753706081] [2019-12-27 06:05:57,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:57,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 06:05:57,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059399903] [2019-12-27 06:05:57,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 06:05:57,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:57,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 06:05:57,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:05:57,185 INFO L87 Difference]: Start difference. First operand 391 states and 676 transitions. Second operand 13 states. [2019-12-27 06:05:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:57,685 INFO L93 Difference]: Finished difference Result 915 states and 1602 transitions. [2019-12-27 06:05:57,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 06:05:57,685 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 74 [2019-12-27 06:05:57,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:57,687 INFO L225 Difference]: With dead ends: 915 [2019-12-27 06:05:57,687 INFO L226 Difference]: Without dead ends: 885 [2019-12-27 06:05:57,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:05:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2019-12-27 06:05:57,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 450. [2019-12-27 06:05:57,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-12-27 06:05:57,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 780 transitions. [2019-12-27 06:05:57,696 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 780 transitions. Word has length 74 [2019-12-27 06:05:57,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:57,696 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 780 transitions. [2019-12-27 06:05:57,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 06:05:57,696 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 780 transitions. [2019-12-27 06:05:57,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 06:05:57,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:57,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:57,698 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:57,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:57,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1807969600, now seen corresponding path program 5 times [2019-12-27 06:05:57,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:57,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310759467] [2019-12-27 06:05:57,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:05:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:05:57,840 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:05:57,840 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:05:57,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~weak$$choice0~0_10) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~y$r_buff1_thd2~0_20) (= 0 v_~y$read_delayed_var~0.offset_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t766~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t766~0.base_27|) |v_ULTIMATE.start_main_~#t766~0.offset_21| 0)) |v_#memory_int_23|) (= v_~y$r_buff0_thd1~0_10 0) (= v_~z~0_11 0) (= v_~y$w_buff1_used~0_77 0) (= v_~y$read_delayed~0_7 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t766~0.base_27|) (= 0 v_~y$r_buff1_thd3~0_40) (= v_~y$mem_tmp~0_13 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t766~0.base_27| 1) |v_#valid_61|) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t766~0.base_27| 4) |v_#length_25|) (= 0 v_~y$r_buff1_thd1~0_10) (= 0 v_~y$w_buff1~0_33) (= |v_ULTIMATE.start_main_~#t766~0.offset_21| 0) (= v_~__unbuffered_p2_EBX~0_5 0) (= 0 v_~y$flush_delayed~0_19) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff1_thd0~0_38) (= v_~y$r_buff0_thd0~0_68 0) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t766~0.base_27|) 0) (= v_~y$r_buff0_thd3~0_80 0) (= v_~__unbuffered_p2_EAX~0_9 0) (= 0 v_~__unbuffered_cnt~0_22) (= v_~x~0_12 0) (= v_~y~0_35 0) (= v_~y$w_buff0_used~0_143 0) (= v_~y$r_buff0_thd2~0_21 0) (= 0 |v_#NULL.base_5|) (= 0 v_~y$w_buff0~0_34))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t766~0.base=|v_ULTIMATE.start_main_~#t766~0.base_27|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_13|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_15|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_13|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_40, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_19, #length=|v_#length_25|, ULTIMATE.start_main_#t~nondet48=|v_ULTIMATE.start_main_#t~nondet48_9|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_5, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_9|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_15|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_14|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_14|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_13|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_15|, ULTIMATE.start_main_~#t767~0.offset=|v_ULTIMATE.start_main_~#t767~0.offset_16|, ~y$w_buff1~0=v_~y$w_buff1~0_33, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ULTIMATE.start_main_~#t766~0.offset=|v_ULTIMATE.start_main_~#t766~0.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_38, ~x~0=v_~x~0_12, ULTIMATE.start_main_~#t768~0.offset=|v_ULTIMATE.start_main_~#t768~0.offset_15|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_143, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_15|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_16|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_14|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_14|, ULTIMATE.start_main_~#t768~0.base=|v_ULTIMATE.start_main_~#t768~0.base_18|, ~y$w_buff0~0=v_~y$w_buff0~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_80, ~y~0=v_~y~0_35, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_14|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_14|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_16|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_13|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ULTIMATE.start_main_~#t767~0.base=|v_ULTIMATE.start_main_~#t767~0.base_19|, ~z~0=v_~z~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_77} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t766~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet48, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet47, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t767~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t766~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t768~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t768~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t767~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 06:05:57,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L818-1-->L820: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t767~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t767~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t767~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t767~0.base_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t767~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t767~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t767~0.base_11|) |v_ULTIMATE.start_main_~#t767~0.offset_11| 1)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t767~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t767~0.offset=|v_ULTIMATE.start_main_~#t767~0.offset_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_17|, ULTIMATE.start_main_~#t767~0.base=|v_ULTIMATE.start_main_~#t767~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t767~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t767~0.base] because there is no mapped edge [2019-12-27 06:05:57,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L820-1-->L822: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t768~0.base_12|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t768~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t768~0.offset_10| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t768~0.base_12|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t768~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t768~0.base_12|) |v_ULTIMATE.start_main_~#t768~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t768~0.base_12|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t768~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t768~0.base=|v_ULTIMATE.start_main_~#t768~0.base_12|, ULTIMATE.start_main_~#t768~0.offset=|v_ULTIMATE.start_main_~#t768~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t768~0.base, ULTIMATE.start_main_~#t768~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 06:05:57,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L4-->L780: Formula: (and (= |v_P2Thread1of1ForFork1_#t~nondet10_6| v_~weak$$choice2~0_30) (= v_~weak$$choice2~0_30 v_~y$flush_delayed~0_10) (= |v_P2Thread1of1ForFork1_#t~nondet9_6| v_~weak$$choice0~0_5) (= v_~y$r_buff0_thd2~0_15 v_~y$r_buff1_thd2~0_13) (= v_~y$r_buff1_thd1~0_4 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd3~0_66 1) (= v_~y$r_buff0_thd3~0_67 v_~y$r_buff1_thd3~0_31) (not (= v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_6 0)) (= v_~y$r_buff0_thd0~0_59 v_~y$r_buff1_thd0~0_31) (= v_~y~0_26 v_~y$mem_tmp~0_6)) InVars {P2Thread1of1ForFork1_#t~nondet10=|v_P2Thread1of1ForFork1_#t~nondet10_6|, P2Thread1of1ForFork1_#t~nondet9=|v_P2Thread1of1ForFork1_#t~nondet9_6|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_59, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, ~y~0=v_~y~0_26, P2Thread1of1ForFork1___VERIFIER_assert_~expression=v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_6} OutVars{P2Thread1of1ForFork1_#t~nondet10=|v_P2Thread1of1ForFork1_#t~nondet10_5|, P2Thread1of1ForFork1_#t~nondet9=|v_P2Thread1of1ForFork1_#t~nondet9_5|, P2Thread1of1ForFork1___VERIFIER_assert_~expression=v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_4, ~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_31, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_66, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_59, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~y~0=v_~y~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~nondet10, P2Thread1of1ForFork1_#t~nondet9, ~y$r_buff0_thd3~0, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 06:05:57,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L780-2-->L780-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-307461808 256))) (.cse2 (= |P2Thread1of1ForFork1_#t~ite11_Out-307461808| |P2Thread1of1ForFork1_#t~ite12_Out-307461808|)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-307461808 256)))) (or (and (or .cse0 .cse1) .cse2 (= |P2Thread1of1ForFork1_#t~ite11_Out-307461808| ~y$w_buff1~0_In-307461808)) (and (not .cse1) .cse2 (not .cse0) (= |P2Thread1of1ForFork1_#t~ite11_Out-307461808| ~y$w_buff0~0_In-307461808)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-307461808, ~y$w_buff1~0=~y$w_buff1~0_In-307461808, ~y$w_buff0~0=~y$w_buff0~0_In-307461808, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-307461808} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-307461808, ~y$w_buff1~0=~y$w_buff1~0_In-307461808, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-307461808|, ~y$w_buff0~0=~y$w_buff0~0_In-307461808, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-307461808, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-307461808|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 06:05:57,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L785-->L786: Formula: (and (= v_~y$r_buff0_thd3~0_63 v_~y$r_buff0_thd3~0_62) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_9|, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_10|, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_8|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 06:05:57,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1643720148 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite31_Out1643720148| ~y$mem_tmp~0_In1643720148)) (and .cse0 (= ~y~0_In1643720148 |P2Thread1of1ForFork1_#t~ite31_Out1643720148|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1643720148, ~y$flush_delayed~0=~y$flush_delayed~0_In1643720148, ~y~0=~y~0_In1643720148} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1643720148, P2Thread1of1ForFork1_#t~ite31=|P2Thread1of1ForFork1_#t~ite31_Out1643720148|, ~y$flush_delayed~0=~y$flush_delayed~0_In1643720148, ~y~0=~y~0_In1643720148} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 06:05:57,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= 1 v_~x~0_8) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= 1 v_~z~0_7) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~z~0=v_~z~0_7, ~x~0=v_~x~0_8, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~z~0, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 06:05:57,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In589393173 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In589393173 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out589393173|) (not .cse1)) (and (= ~y$w_buff0_used~0_In589393173 |P2Thread1of1ForFork1_#t~ite34_Out589393173|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In589393173, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In589393173} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In589393173, P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out589393173|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In589393173} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 06:05:57,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L750-2-->L750-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork0_#t~ite4_Out1294452166| |P1Thread1of1ForFork0_#t~ite3_Out1294452166|)) (.cse2 (= (mod ~y$w_buff1_used~0_In1294452166 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1294452166 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= ~y$w_buff1~0_In1294452166 |P1Thread1of1ForFork0_#t~ite3_Out1294452166|)) (and .cse1 (or .cse2 .cse0) (= ~y~0_In1294452166 |P1Thread1of1ForFork0_#t~ite3_Out1294452166|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1294452166, ~y$w_buff1~0=~y$w_buff1~0_In1294452166, ~y~0=~y~0_In1294452166, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1294452166} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1294452166, ~y$w_buff1~0=~y$w_buff1~0_In1294452166, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out1294452166|, ~y~0=~y~0_In1294452166, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out1294452166|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1294452166} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 06:05:57,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-204628887 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-204628887 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite5_Out-204628887| ~y$w_buff0_used~0_In-204628887)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite5_Out-204628887| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-204628887, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-204628887} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-204628887, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-204628887, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out-204628887|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:05:57,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-974870793 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-974870793 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-974870793 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-974870793 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite6_Out-974870793| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite6_Out-974870793| ~y$w_buff1_used~0_In-974870793) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-974870793, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-974870793, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-974870793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-974870793} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-974870793, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-974870793, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-974870793, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out-974870793|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-974870793} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:05:57,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L753-->L753-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In915727594 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In915727594 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In915727594 |P1Thread1of1ForFork0_#t~ite7_Out915727594|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite7_Out915727594|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In915727594, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In915727594} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In915727594, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In915727594, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out915727594|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 06:05:57,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1411481390 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1411481390 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1411481390 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1411481390 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite8_Out1411481390| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite8_Out1411481390| ~y$r_buff1_thd2~0_In1411481390)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1411481390, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1411481390, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1411481390, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1411481390} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1411481390, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1411481390, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1411481390, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out1411481390|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1411481390} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:05:57,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1617061709 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1617061709 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In1617061709 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1617061709 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out1617061709| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite35_Out1617061709| ~y$w_buff1_used~0_In1617061709) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1617061709, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1617061709, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1617061709, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1617061709} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1617061709|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1617061709, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1617061709, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1617061709, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1617061709} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 06:05:57,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L798-->L799: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-462762412 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-462762412 256)))) (or (and (= ~y$r_buff0_thd3~0_In-462762412 ~y$r_buff0_thd3~0_Out-462762412) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out-462762412) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-462762412, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-462762412} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-462762412|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-462762412, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-462762412} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 06:05:57,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1597999491 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-1597999491 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1597999491 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1597999491 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out-1597999491| ~y$r_buff1_thd3~0_In-1597999491) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-1597999491|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1597999491, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1597999491, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1597999491, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1597999491} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1597999491, P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1597999491|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1597999491, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1597999491, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1597999491} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 06:05:57,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd3~0_34 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_34, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 06:05:57,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L754-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= |v_P1Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd2~0_15) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_7|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 06:05:57,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L822-1-->L828: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= 3 v_~__unbuffered_cnt~0_12)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:05:57,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-960110479 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-960110479 256)))) (or (and (= ~y~0_In-960110479 |ULTIMATE.start_main_#t~ite41_Out-960110479|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out-960110479| ~y$w_buff1~0_In-960110479)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-960110479, ~y~0=~y~0_In-960110479, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-960110479, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-960110479} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-960110479|, ~y$w_buff1~0=~y$w_buff1~0_In-960110479, ~y~0=~y~0_In-960110479, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-960110479, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-960110479} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 06:05:57,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L828-4-->L829: Formula: (= v_~y~0_24 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ~y~0=v_~y~0_24, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:05:57,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-204739280 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-204739280 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-204739280| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out-204739280| ~y$w_buff0_used~0_In-204739280) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-204739280, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-204739280} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-204739280, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-204739280, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-204739280|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 06:05:57,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-617963344 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-617963344 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-617963344 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-617963344 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-617963344| ~y$w_buff1_used~0_In-617963344) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite44_Out-617963344| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-617963344, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-617963344, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-617963344, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-617963344} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-617963344, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-617963344, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-617963344, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-617963344|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-617963344} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:05:57,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1298589319 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1298589319 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1298589319| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out1298589319| ~y$r_buff0_thd0~0_In1298589319) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1298589319, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1298589319} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1298589319, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1298589319, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1298589319|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 06:05:57,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-653484178 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-653484178 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-653484178 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-653484178 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-653484178|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In-653484178 |ULTIMATE.start_main_#t~ite46_Out-653484178|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-653484178, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-653484178, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-653484178, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-653484178} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-653484178, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-653484178, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-653484178|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-653484178, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-653484178} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 06:05:57,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L847-->L847-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1397858132 256) 0))) (or (and (= ~y$mem_tmp~0_In1397858132 |ULTIMATE.start_main_#t~ite69_Out1397858132|) (not .cse0)) (and (= ~y~0_In1397858132 |ULTIMATE.start_main_#t~ite69_Out1397858132|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1397858132, ~y$flush_delayed~0=~y$flush_delayed~0_In1397858132, ~y~0=~y~0_In1397858132} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1397858132, ~y$flush_delayed~0=~y$flush_delayed~0_In1397858132, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out1397858132|, ~y~0=~y~0_In1397858132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-27 06:05:57,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~y~0_32 |v_ULTIMATE.start_main_#t~ite69_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= (mod v_~main$tmp_guard1~0_14 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= 0 v_~y$flush_delayed~0_16)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_11|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_10|, ~y~0=v_~y~0_32, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite69, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:05:57,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:05:57 BasicIcfg [2019-12-27 06:05:57,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:05:57,992 INFO L168 Benchmark]: Toolchain (without parser) took 40589.66 ms. Allocated memory was 144.2 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 100.1 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 236.3 MB. Max. memory is 7.1 GB. [2019-12-27 06:05:57,993 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 06:05:57,994 INFO L168 Benchmark]: CACSL2BoogieTranslator took 829.44 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 151.3 MB in the end (delta: -51.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:05:57,994 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.66 ms. Allocated memory is still 201.3 MB. Free memory was 151.3 MB in the beginning and 147.8 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:05:57,995 INFO L168 Benchmark]: Boogie Preprocessor took 43.64 ms. Allocated memory is still 201.3 MB. Free memory was 147.8 MB in the beginning and 145.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:05:57,995 INFO L168 Benchmark]: RCFGBuilder took 1001.97 ms. Allocated memory is still 201.3 MB. Free memory was 145.0 MB in the beginning and 86.9 MB in the end (delta: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:05:57,996 INFO L168 Benchmark]: TraceAbstraction took 38603.38 ms. Allocated memory was 232.3 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 202.8 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 250.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:05:57,999 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.18 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 829.44 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 151.3 MB in the end (delta: -51.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 88.66 ms. Allocated memory is still 201.3 MB. Free memory was 151.3 MB in the beginning and 147.8 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.64 ms. Allocated memory is still 201.3 MB. Free memory was 147.8 MB in the beginning and 145.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1001.97 ms. Allocated memory is still 201.3 MB. Free memory was 145.0 MB in the beginning and 86.9 MB in the end (delta: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 38603.38 ms. Allocated memory was 232.3 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 202.8 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 250.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 205 ProgramPointsBefore, 122 ProgramPointsAfterwards, 257 TransitionsBefore, 145 TransitionsAfterwards, 26988 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 33 ChoiceCompositions, 9159 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 170994 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t766, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t767, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t768, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L764] 3 y$w_buff1 = y$w_buff0 [L765] 3 y$w_buff0 = 2 [L766] 3 y$w_buff1_used = y$w_buff0_used [L767] 3 y$w_buff0_used = (_Bool)1 [L780] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L781] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L782] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L783] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L784] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 y = y$flush_delayed ? y$mem_tmp : y [L789] 3 y$flush_delayed = (_Bool)0 [L792] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 2 x = 2 [L747] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L751] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L753] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L797] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L828] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L829] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L830] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L831] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L832] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L835] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 0 y$flush_delayed = weak$$choice2 [L838] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L840] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L840] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L841] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L841] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L842] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L842] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L843] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L844] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L845] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L845] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 196 locations, 2 error locations. Result: UNSAFE, OverallTime: 38.2s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3369 SDtfs, 3652 SDslu, 7760 SDs, 0 SdLazy, 3920 SolverSat, 200 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 33 SyntacticMatches, 29 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90710occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 9618 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1169 NumberOfCodeBlocks, 1169 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1076 ConstructedInterpolants, 0 QuantifiedInterpolants, 301148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...