/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:10:18,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:10:18,075 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:10:18,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:10:18,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:10:18,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:10:18,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:10:18,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:10:18,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:10:18,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:10:18,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:10:18,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:10:18,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:10:18,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:10:18,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:10:18,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:10:18,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:10:18,105 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:10:18,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:10:18,109 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:10:18,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:10:18,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:10:18,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:10:18,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:10:18,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:10:18,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:10:18,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:10:18,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:10:18,118 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:10:18,119 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:10:18,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:10:18,120 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:10:18,121 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:10:18,122 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:10:18,123 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:10:18,123 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:10:18,124 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:10:18,124 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:10:18,125 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:10:18,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:10:18,126 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:10:18,127 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:10:18,142 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:10:18,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:10:18,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:10:18,143 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:10:18,144 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:10:18,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:10:18,144 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:10:18,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:10:18,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:10:18,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:10:18,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:10:18,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:10:18,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:10:18,146 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:10:18,146 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:10:18,146 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:10:18,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:10:18,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:10:18,147 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:10:18,147 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:10:18,147 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:10:18,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:10:18,147 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:10:18,148 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:10:18,148 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:10:18,148 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:10:18,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:10:18,148 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:10:18,149 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:10:18,149 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:10:18,417 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:10:18,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:10:18,435 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:10:18,437 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:10:18,437 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:10:18,438 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_pso.opt.i [2019-12-18 12:10:18,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/066775bfd/5f1dca94bbcd4f50a806d9408f41ab5b/FLAG9b445d0e7 [2019-12-18 12:10:19,111 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:10:19,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_pso.opt.i [2019-12-18 12:10:19,134 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/066775bfd/5f1dca94bbcd4f50a806d9408f41ab5b/FLAG9b445d0e7 [2019-12-18 12:10:19,372 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/066775bfd/5f1dca94bbcd4f50a806d9408f41ab5b [2019-12-18 12:10:19,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:10:19,382 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:10:19,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:10:19,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:10:19,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:10:19,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:10:19" (1/1) ... [2019-12-18 12:10:19,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e76b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:10:19, skipping insertion in model container [2019-12-18 12:10:19,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:10:19" (1/1) ... [2019-12-18 12:10:19,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:10:19,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:10:19,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:10:20,007 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:10:20,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:10:20,171 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:10:20,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:10:20 WrapperNode [2019-12-18 12:10:20,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:10:20,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:10:20,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:10:20,173 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:10:20,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:10:20" (1/1) ... [2019-12-18 12:10:20,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:10:20" (1/1) ... [2019-12-18 12:10:20,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:10:20,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:10:20,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:10:20,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:10:20,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:10:20" (1/1) ... [2019-12-18 12:10:20,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:10:20" (1/1) ... [2019-12-18 12:10:20,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:10:20" (1/1) ... [2019-12-18 12:10:20,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:10:20" (1/1) ... [2019-12-18 12:10:20,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:10:20" (1/1) ... [2019-12-18 12:10:20,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:10:20" (1/1) ... [2019-12-18 12:10:20,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:10:20" (1/1) ... [2019-12-18 12:10:20,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:10:20,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:10:20,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:10:20,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:10:20,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:10:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:10:20,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:10:20,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:10:20,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:10:20,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:10:20,362 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:10:20,363 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:10:20,363 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:10:20,364 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:10:20,364 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:10:20,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:10:20,365 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 12:10:20,366 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 12:10:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:10:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:10:20,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:10:20,369 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:10:21,234 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:10:21,234 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:10:21,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:10:21 BoogieIcfgContainer [2019-12-18 12:10:21,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:10:21,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:10:21,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:10:21,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:10:21,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:10:19" (1/3) ... [2019-12-18 12:10:21,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b27062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:10:21, skipping insertion in model container [2019-12-18 12:10:21,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:10:20" (2/3) ... [2019-12-18 12:10:21,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b27062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:10:21, skipping insertion in model container [2019-12-18 12:10:21,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:10:21" (3/3) ... [2019-12-18 12:10:21,245 INFO L109 eAbstractionObserver]: Analyzing ICFG mix005_pso.opt.i [2019-12-18 12:10:21,255 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:10:21,256 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:10:21,263 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:10:21,264 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:10:21,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,322 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,322 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,324 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,324 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,326 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,327 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,347 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,347 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,347 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,347 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,348 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,348 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,348 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,348 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,349 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,349 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,349 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,349 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,349 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,350 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,350 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,350 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,350 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,350 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,351 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,351 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,351 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,351 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,352 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,352 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,352 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,352 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,352 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,355 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,355 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,355 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,355 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,355 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,356 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,356 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,356 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,356 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,356 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,357 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,357 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,357 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,357 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,357 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,358 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,358 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,358 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,358 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,358 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,359 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,359 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,359 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,359 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,359 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,359 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,360 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,360 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,360 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,360 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,361 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,361 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,361 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,361 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,361 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,361 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,362 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,362 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,362 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,362 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,362 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,363 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,363 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,363 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,363 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,363 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,363 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,364 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,364 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,364 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,364 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,365 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,365 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,365 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,365 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,365 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,366 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,366 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,366 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,366 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,366 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,367 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,367 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,367 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,367 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,367 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,368 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,368 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,368 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,368 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,368 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,369 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,369 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,369 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,369 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,369 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,370 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,370 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,370 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,370 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,371 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,371 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,371 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,371 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,371 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,375 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,375 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,380 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,381 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,386 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,387 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,387 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,387 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,387 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,387 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,388 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,388 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,388 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,388 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,388 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,388 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,389 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,389 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,389 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,389 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,389 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,390 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,390 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,390 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,390 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,390 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,390 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,391 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,391 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,391 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,391 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,391 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,392 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,392 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,392 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,392 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,392 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,392 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,393 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,395 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,396 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:10:21,411 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 12:10:21,432 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:10:21,432 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:10:21,432 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:10:21,432 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:10:21,432 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:10:21,433 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:10:21,433 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:10:21,433 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:10:21,451 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 255 transitions [2019-12-18 12:10:21,453 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-18 12:10:21,568 INFO L126 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-18 12:10:21,568 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:10:21,597 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 559 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-18 12:10:21,633 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-18 12:10:21,711 INFO L126 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-18 12:10:21,712 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:10:21,722 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 559 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-18 12:10:21,756 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-18 12:10:21,758 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:10:27,795 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-12-18 12:10:27,970 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 12:10:28,110 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 12:10:28,549 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 12:10:28,706 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 12:10:28,754 INFO L206 etLargeBlockEncoding]: Checked pairs total: 141939 [2019-12-18 12:10:28,754 INFO L214 etLargeBlockEncoding]: Total number of compositions: 133 [2019-12-18 12:10:28,758 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 132 transitions [2019-12-18 12:10:38,298 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85966 states. [2019-12-18 12:10:38,300 INFO L276 IsEmpty]: Start isEmpty. Operand 85966 states. [2019-12-18 12:10:38,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 12:10:38,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:10:38,308 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:10:38,308 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:10:38,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:10:38,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1287441752, now seen corresponding path program 1 times [2019-12-18 12:10:38,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:10:38,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148654467] [2019-12-18 12:10:38,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:10:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:10:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:10:38,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148654467] [2019-12-18 12:10:38,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:10:38,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:10:38,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182526510] [2019-12-18 12:10:38,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:10:38,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:10:38,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:10:38,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:10:38,654 INFO L87 Difference]: Start difference. First operand 85966 states. Second operand 3 states. [2019-12-18 12:10:41,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:10:41,867 INFO L93 Difference]: Finished difference Result 85406 states and 393472 transitions. [2019-12-18 12:10:41,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:10:41,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 12:10:41,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:10:42,655 INFO L225 Difference]: With dead ends: 85406 [2019-12-18 12:10:42,655 INFO L226 Difference]: Without dead ends: 79558 [2019-12-18 12:10:42,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:10:44,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79558 states. [2019-12-18 12:10:49,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79558 to 79558. [2019-12-18 12:10:49,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79558 states. [2019-12-18 12:10:49,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79558 states to 79558 states and 366284 transitions. [2019-12-18 12:10:49,717 INFO L78 Accepts]: Start accepts. Automaton has 79558 states and 366284 transitions. Word has length 9 [2019-12-18 12:10:49,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:10:49,718 INFO L462 AbstractCegarLoop]: Abstraction has 79558 states and 366284 transitions. [2019-12-18 12:10:49,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:10:49,718 INFO L276 IsEmpty]: Start isEmpty. Operand 79558 states and 366284 transitions. [2019-12-18 12:10:49,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 12:10:49,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:10:49,728 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:10:49,729 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:10:49,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:10:49,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1721975953, now seen corresponding path program 1 times [2019-12-18 12:10:49,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:10:49,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559411310] [2019-12-18 12:10:49,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:10:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:10:49,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:10:49,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559411310] [2019-12-18 12:10:49,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:10:49,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:10:49,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888414041] [2019-12-18 12:10:49,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:10:49,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:10:49,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:10:49,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:10:49,840 INFO L87 Difference]: Start difference. First operand 79558 states and 366284 transitions. Second operand 4 states. [2019-12-18 12:10:54,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:10:54,084 INFO L93 Difference]: Finished difference Result 126790 states and 563012 transitions. [2019-12-18 12:10:54,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:10:54,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 12:10:54,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:10:54,747 INFO L225 Difference]: With dead ends: 126790 [2019-12-18 12:10:54,747 INFO L226 Difference]: Without dead ends: 126726 [2019-12-18 12:10:54,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:10:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126726 states. [2019-12-18 12:10:59,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126726 to 123582. [2019-12-18 12:10:59,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123582 states. [2019-12-18 12:11:05,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123582 states to 123582 states and 551516 transitions. [2019-12-18 12:11:05,941 INFO L78 Accepts]: Start accepts. Automaton has 123582 states and 551516 transitions. Word has length 15 [2019-12-18 12:11:05,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:11:05,942 INFO L462 AbstractCegarLoop]: Abstraction has 123582 states and 551516 transitions. [2019-12-18 12:11:05,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:11:05,942 INFO L276 IsEmpty]: Start isEmpty. Operand 123582 states and 551516 transitions. [2019-12-18 12:11:05,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 12:11:05,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:11:05,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:11:05,950 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:11:05,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:11:05,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1760528869, now seen corresponding path program 1 times [2019-12-18 12:11:05,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:11:05,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543089292] [2019-12-18 12:11:05,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:11:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:11:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:11:06,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543089292] [2019-12-18 12:11:06,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:11:06,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:11:06,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128022815] [2019-12-18 12:11:06,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:11:06,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:11:06,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:11:06,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:11:06,061 INFO L87 Difference]: Start difference. First operand 123582 states and 551516 transitions. Second operand 4 states. [2019-12-18 12:11:11,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:11:11,855 INFO L93 Difference]: Finished difference Result 159910 states and 703928 transitions. [2019-12-18 12:11:11,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:11:11,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 12:11:11,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:11:12,407 INFO L225 Difference]: With dead ends: 159910 [2019-12-18 12:11:12,407 INFO L226 Difference]: Without dead ends: 159850 [2019-12-18 12:11:12,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:11:14,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159850 states. [2019-12-18 12:11:16,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159850 to 141658. [2019-12-18 12:11:16,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141658 states. [2019-12-18 12:11:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141658 states to 141658 states and 629312 transitions. [2019-12-18 12:11:18,459 INFO L78 Accepts]: Start accepts. Automaton has 141658 states and 629312 transitions. Word has length 18 [2019-12-18 12:11:18,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:11:18,459 INFO L462 AbstractCegarLoop]: Abstraction has 141658 states and 629312 transitions. [2019-12-18 12:11:18,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:11:18,460 INFO L276 IsEmpty]: Start isEmpty. Operand 141658 states and 629312 transitions. [2019-12-18 12:11:18,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 12:11:18,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:11:18,479 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] [2019-12-18 12:11:18,480 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:11:18,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:11:18,480 INFO L82 PathProgramCache]: Analyzing trace with hash 176800759, now seen corresponding path program 1 times [2019-12-18 12:11:18,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:11:18,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135777084] [2019-12-18 12:11:18,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:11:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:11:18,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:11:18,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135777084] [2019-12-18 12:11:18,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:11:18,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:11:18,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205259104] [2019-12-18 12:11:18,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:11:18,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:11:18,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:11:18,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:11:18,560 INFO L87 Difference]: Start difference. First operand 141658 states and 629312 transitions. Second operand 3 states. [2019-12-18 12:11:25,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:11:25,133 INFO L93 Difference]: Finished difference Result 138699 states and 613164 transitions. [2019-12-18 12:11:25,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:11:25,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-18 12:11:25,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:11:25,607 INFO L225 Difference]: With dead ends: 138699 [2019-12-18 12:11:25,607 INFO L226 Difference]: Without dead ends: 138699 [2019-12-18 12:11:25,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:11:27,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138699 states. [2019-12-18 12:11:29,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138699 to 138699. [2019-12-18 12:11:29,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138699 states. [2019-12-18 12:11:30,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138699 states to 138699 states and 613164 transitions. [2019-12-18 12:11:30,480 INFO L78 Accepts]: Start accepts. Automaton has 138699 states and 613164 transitions. Word has length 20 [2019-12-18 12:11:30,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:11:30,480 INFO L462 AbstractCegarLoop]: Abstraction has 138699 states and 613164 transitions. [2019-12-18 12:11:30,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:11:30,481 INFO L276 IsEmpty]: Start isEmpty. Operand 138699 states and 613164 transitions. [2019-12-18 12:11:30,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 12:11:30,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:11:30,499 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] [2019-12-18 12:11:30,499 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:11:30,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:11:30,499 INFO L82 PathProgramCache]: Analyzing trace with hash -489613445, now seen corresponding path program 1 times [2019-12-18 12:11:30,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:11:30,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634703374] [2019-12-18 12:11:30,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:11:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:11:30,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:11:30,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634703374] [2019-12-18 12:11:30,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:11:30,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:11:30,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348288408] [2019-12-18 12:11:30,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:11:30,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:11:30,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:11:30,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:11:30,564 INFO L87 Difference]: Start difference. First operand 138699 states and 613164 transitions. Second operand 3 states. [2019-12-18 12:11:36,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:11:36,592 INFO L93 Difference]: Finished difference Result 171153 states and 718929 transitions. [2019-12-18 12:11:36,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:11:36,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 12:11:36,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:11:37,044 INFO L225 Difference]: With dead ends: 171153 [2019-12-18 12:11:37,045 INFO L226 Difference]: Without dead ends: 139246 [2019-12-18 12:11:37,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:11:38,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139246 states. [2019-12-18 12:11:40,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139246 to 136241. [2019-12-18 12:11:40,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136241 states. [2019-12-18 12:11:41,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136241 states to 136241 states and 569267 transitions. [2019-12-18 12:11:41,455 INFO L78 Accepts]: Start accepts. Automaton has 136241 states and 569267 transitions. Word has length 21 [2019-12-18 12:11:41,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:11:41,456 INFO L462 AbstractCegarLoop]: Abstraction has 136241 states and 569267 transitions. [2019-12-18 12:11:41,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:11:41,456 INFO L276 IsEmpty]: Start isEmpty. Operand 136241 states and 569267 transitions. [2019-12-18 12:11:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 12:11:41,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:11:41,468 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] [2019-12-18 12:11:41,468 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:11:41,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:11:41,469 INFO L82 PathProgramCache]: Analyzing trace with hash 338661360, now seen corresponding path program 1 times [2019-12-18 12:11:41,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:11:41,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309841741] [2019-12-18 12:11:41,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:11:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:11:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:11:41,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309841741] [2019-12-18 12:11:41,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:11:41,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:11:41,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506214892] [2019-12-18 12:11:41,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:11:41,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:11:41,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:11:41,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:11:41,521 INFO L87 Difference]: Start difference. First operand 136241 states and 569267 transitions. Second operand 3 states. [2019-12-18 12:11:43,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:11:43,295 INFO L93 Difference]: Finished difference Result 136067 states and 568622 transitions. [2019-12-18 12:11:43,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:11:43,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 12:11:43,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:11:43,697 INFO L225 Difference]: With dead ends: 136067 [2019-12-18 12:11:43,697 INFO L226 Difference]: Without dead ends: 136067 [2019-12-18 12:11:43,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:11:46,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136067 states. [2019-12-18 12:11:53,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136067 to 136067. [2019-12-18 12:11:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136067 states. [2019-12-18 12:11:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136067 states to 136067 states and 568622 transitions. [2019-12-18 12:11:55,003 INFO L78 Accepts]: Start accepts. Automaton has 136067 states and 568622 transitions. Word has length 21 [2019-12-18 12:11:55,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:11:55,003 INFO L462 AbstractCegarLoop]: Abstraction has 136067 states and 568622 transitions. [2019-12-18 12:11:55,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:11:55,003 INFO L276 IsEmpty]: Start isEmpty. Operand 136067 states and 568622 transitions. [2019-12-18 12:11:55,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:11:55,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:11:55,022 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] [2019-12-18 12:11:55,023 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:11:55,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:11:55,023 INFO L82 PathProgramCache]: Analyzing trace with hash -722262292, now seen corresponding path program 1 times [2019-12-18 12:11:55,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:11:55,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928785582] [2019-12-18 12:11:55,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:11:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:11:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:11:55,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928785582] [2019-12-18 12:11:55,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:11:55,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:11:55,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429921858] [2019-12-18 12:11:55,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:11:55,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:11:55,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:11:55,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:11:55,080 INFO L87 Difference]: Start difference. First operand 136067 states and 568622 transitions. Second operand 3 states. [2019-12-18 12:11:55,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:11:55,805 INFO L93 Difference]: Finished difference Result 132051 states and 552314 transitions. [2019-12-18 12:11:55,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:11:55,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-18 12:11:55,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:11:56,176 INFO L225 Difference]: With dead ends: 132051 [2019-12-18 12:11:56,177 INFO L226 Difference]: Without dead ends: 132051 [2019-12-18 12:11:56,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:12:02,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132051 states. [2019-12-18 12:12:04,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132051 to 131955. [2019-12-18 12:12:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131955 states. [2019-12-18 12:12:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131955 states to 131955 states and 552098 transitions. [2019-12-18 12:12:05,706 INFO L78 Accepts]: Start accepts. Automaton has 131955 states and 552098 transitions. Word has length 22 [2019-12-18 12:12:05,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:12:05,707 INFO L462 AbstractCegarLoop]: Abstraction has 131955 states and 552098 transitions. [2019-12-18 12:12:05,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:12:05,707 INFO L276 IsEmpty]: Start isEmpty. Operand 131955 states and 552098 transitions. [2019-12-18 12:12:05,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 12:12:05,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:12:05,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:12:05,736 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:12:05,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:12:05,736 INFO L82 PathProgramCache]: Analyzing trace with hash -923267308, now seen corresponding path program 1 times [2019-12-18 12:12:05,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:12:05,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320318031] [2019-12-18 12:12:05,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:12:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:12:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:12:05,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320318031] [2019-12-18 12:12:05,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:12:05,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:12:05,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447579729] [2019-12-18 12:12:05,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:12:05,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:12:05,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:12:05,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:12:05,806 INFO L87 Difference]: Start difference. First operand 131955 states and 552098 transitions. Second operand 5 states. [2019-12-18 12:12:07,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:12:07,226 INFO L93 Difference]: Finished difference Result 157697 states and 651127 transitions. [2019-12-18 12:12:07,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:12:07,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 12:12:07,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:12:13,076 INFO L225 Difference]: With dead ends: 157697 [2019-12-18 12:12:13,077 INFO L226 Difference]: Without dead ends: 157192 [2019-12-18 12:12:13,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:12:14,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157192 states. [2019-12-18 12:12:16,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157192 to 131020. [2019-12-18 12:12:16,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131020 states. [2019-12-18 12:12:17,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131020 states to 131020 states and 548465 transitions. [2019-12-18 12:12:17,391 INFO L78 Accepts]: Start accepts. Automaton has 131020 states and 548465 transitions. Word has length 24 [2019-12-18 12:12:17,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:12:17,391 INFO L462 AbstractCegarLoop]: Abstraction has 131020 states and 548465 transitions. [2019-12-18 12:12:17,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:12:17,391 INFO L276 IsEmpty]: Start isEmpty. Operand 131020 states and 548465 transitions. [2019-12-18 12:12:17,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-18 12:12:17,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:12:17,555 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] [2019-12-18 12:12:17,555 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:12:17,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:12:17,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1238013314, now seen corresponding path program 1 times [2019-12-18 12:12:17,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:12:17,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965147920] [2019-12-18 12:12:17,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:12:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:12:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:12:17,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965147920] [2019-12-18 12:12:17,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:12:17,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:12:17,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030063451] [2019-12-18 12:12:17,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:12:17,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:12:17,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:12:17,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:12:17,661 INFO L87 Difference]: Start difference. First operand 131020 states and 548465 transitions. Second operand 3 states. [2019-12-18 12:12:19,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:12:19,294 INFO L93 Difference]: Finished difference Result 131020 states and 542445 transitions. [2019-12-18 12:12:19,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:12:19,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-18 12:12:19,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:12:19,714 INFO L225 Difference]: With dead ends: 131020 [2019-12-18 12:12:19,714 INFO L226 Difference]: Without dead ends: 131020 [2019-12-18 12:12:19,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:12:21,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131020 states. [2019-12-18 12:12:27,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131020 to 130668. [2019-12-18 12:12:27,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130668 states. [2019-12-18 12:12:28,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130668 states to 130668 states and 541245 transitions. [2019-12-18 12:12:28,389 INFO L78 Accepts]: Start accepts. Automaton has 130668 states and 541245 transitions. Word has length 36 [2019-12-18 12:12:28,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:12:28,389 INFO L462 AbstractCegarLoop]: Abstraction has 130668 states and 541245 transitions. [2019-12-18 12:12:28,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:12:28,389 INFO L276 IsEmpty]: Start isEmpty. Operand 130668 states and 541245 transitions. [2019-12-18 12:12:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 12:12:28,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:12:28,544 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] [2019-12-18 12:12:28,544 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:12:28,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:12:28,544 INFO L82 PathProgramCache]: Analyzing trace with hash -408828653, now seen corresponding path program 1 times [2019-12-18 12:12:28,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:12:28,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564830454] [2019-12-18 12:12:28,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:12:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:12:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:12:28,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564830454] [2019-12-18 12:12:28,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:12:28,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:12:28,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784038008] [2019-12-18 12:12:28,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:12:28,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:12:28,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:12:28,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:12:28,664 INFO L87 Difference]: Start difference. First operand 130668 states and 541245 transitions. Second operand 9 states. [2019-12-18 12:12:38,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:12:38,168 INFO L93 Difference]: Finished difference Result 317780 states and 1326818 transitions. [2019-12-18 12:12:38,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:12:38,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-12-18 12:12:38,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:12:38,978 INFO L225 Difference]: With dead ends: 317780 [2019-12-18 12:12:38,978 INFO L226 Difference]: Without dead ends: 265876 [2019-12-18 12:12:38,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-12-18 12:12:41,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265876 states. [2019-12-18 12:12:45,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265876 to 193200. [2019-12-18 12:12:45,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193200 states. [2019-12-18 12:12:47,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193200 states to 193200 states and 812708 transitions. [2019-12-18 12:12:47,446 INFO L78 Accepts]: Start accepts. Automaton has 193200 states and 812708 transitions. Word has length 37 [2019-12-18 12:12:47,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:12:47,446 INFO L462 AbstractCegarLoop]: Abstraction has 193200 states and 812708 transitions. [2019-12-18 12:12:47,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:12:47,446 INFO L276 IsEmpty]: Start isEmpty. Operand 193200 states and 812708 transitions. [2019-12-18 12:12:47,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 12:12:47,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:12:47,720 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] [2019-12-18 12:12:47,720 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:12:47,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:12:47,720 INFO L82 PathProgramCache]: Analyzing trace with hash 852679073, now seen corresponding path program 2 times [2019-12-18 12:12:47,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:12:47,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377966444] [2019-12-18 12:12:47,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:12:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:12:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:12:47,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377966444] [2019-12-18 12:12:47,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:12:47,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:12:47,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336899210] [2019-12-18 12:12:47,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:12:47,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:12:47,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:12:47,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:12:47,805 INFO L87 Difference]: Start difference. First operand 193200 states and 812708 transitions. Second operand 5 states. [2019-12-18 12:12:48,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:12:48,146 INFO L93 Difference]: Finished difference Result 72235 states and 256279 transitions. [2019-12-18 12:12:48,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:12:48,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 12:12:48,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:12:48,268 INFO L225 Difference]: With dead ends: 72235 [2019-12-18 12:12:48,268 INFO L226 Difference]: Without dead ends: 60483 [2019-12-18 12:12:48,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:12:48,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60483 states. [2019-12-18 12:12:50,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60483 to 60483. [2019-12-18 12:12:50,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60483 states. [2019-12-18 12:12:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60483 states to 60483 states and 208420 transitions. [2019-12-18 12:12:50,987 INFO L78 Accepts]: Start accepts. Automaton has 60483 states and 208420 transitions. Word has length 37 [2019-12-18 12:12:50,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:12:50,987 INFO L462 AbstractCegarLoop]: Abstraction has 60483 states and 208420 transitions. [2019-12-18 12:12:50,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:12:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 60483 states and 208420 transitions. [2019-12-18 12:12:51,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 12:12:51,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:12:51,042 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] [2019-12-18 12:12:51,043 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:12:51,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:12:51,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1191936355, now seen corresponding path program 1 times [2019-12-18 12:12:51,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:12:51,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214660825] [2019-12-18 12:12:51,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:12:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:12:51,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:12:51,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214660825] [2019-12-18 12:12:51,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:12:51,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:12:51,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413010151] [2019-12-18 12:12:51,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:12:51,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:12:51,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:12:51,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:12:51,210 INFO L87 Difference]: Start difference. First operand 60483 states and 208420 transitions. Second operand 10 states. [2019-12-18 12:12:53,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:12:53,129 INFO L93 Difference]: Finished difference Result 102374 states and 355733 transitions. [2019-12-18 12:12:53,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:12:53,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-12-18 12:12:53,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:12:53,342 INFO L225 Difference]: With dead ends: 102374 [2019-12-18 12:12:53,342 INFO L226 Difference]: Without dead ends: 97382 [2019-12-18 12:12:53,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=605, Unknown=0, NotChecked=0, Total=812 [2019-12-18 12:12:53,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97382 states. [2019-12-18 12:12:57,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97382 to 62126. [2019-12-18 12:12:57,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62126 states. [2019-12-18 12:12:57,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62126 states to 62126 states and 214828 transitions. [2019-12-18 12:12:57,684 INFO L78 Accepts]: Start accepts. Automaton has 62126 states and 214828 transitions. Word has length 38 [2019-12-18 12:12:57,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:12:57,684 INFO L462 AbstractCegarLoop]: Abstraction has 62126 states and 214828 transitions. [2019-12-18 12:12:57,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:12:57,685 INFO L276 IsEmpty]: Start isEmpty. Operand 62126 states and 214828 transitions. [2019-12-18 12:12:57,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 12:12:57,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:12:57,741 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] [2019-12-18 12:12:57,742 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:12:57,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:12:57,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1266404269, now seen corresponding path program 2 times [2019-12-18 12:12:57,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:12:57,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290400773] [2019-12-18 12:12:57,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:12:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:12:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:12:57,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290400773] [2019-12-18 12:12:57,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:12:57,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:12:57,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603988268] [2019-12-18 12:12:57,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:12:57,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:12:57,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:12:57,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:12:57,826 INFO L87 Difference]: Start difference. First operand 62126 states and 214828 transitions. Second operand 7 states. [2019-12-18 12:12:59,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:12:59,127 INFO L93 Difference]: Finished difference Result 116359 states and 398873 transitions. [2019-12-18 12:12:59,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:12:59,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-12-18 12:12:59,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:12:59,341 INFO L225 Difference]: With dead ends: 116359 [2019-12-18 12:12:59,341 INFO L226 Difference]: Without dead ends: 103956 [2019-12-18 12:12:59,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:13:00,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103956 states. [2019-12-18 12:13:01,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103956 to 67769. [2019-12-18 12:13:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67769 states. [2019-12-18 12:13:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67769 states to 67769 states and 233166 transitions. [2019-12-18 12:13:02,233 INFO L78 Accepts]: Start accepts. Automaton has 67769 states and 233166 transitions. Word has length 38 [2019-12-18 12:13:02,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:13:02,233 INFO L462 AbstractCegarLoop]: Abstraction has 67769 states and 233166 transitions. [2019-12-18 12:13:02,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:13:02,233 INFO L276 IsEmpty]: Start isEmpty. Operand 67769 states and 233166 transitions. [2019-12-18 12:13:02,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:13:02,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:13:02,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:13:02,305 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:13:02,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:13:02,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1377430370, now seen corresponding path program 1 times [2019-12-18 12:13:02,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:13:02,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552522665] [2019-12-18 12:13:02,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:13:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:13:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:13:02,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552522665] [2019-12-18 12:13:02,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:13:02,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:13:02,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176457379] [2019-12-18 12:13:02,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:13:02,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:13:02,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:13:02,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:13:02,405 INFO L87 Difference]: Start difference. First operand 67769 states and 233166 transitions. Second operand 6 states. [2019-12-18 12:13:02,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:13:02,565 INFO L93 Difference]: Finished difference Result 18200 states and 59916 transitions. [2019-12-18 12:13:02,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:13:02,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-18 12:13:02,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:13:02,599 INFO L225 Difference]: With dead ends: 18200 [2019-12-18 12:13:02,599 INFO L226 Difference]: Without dead ends: 14583 [2019-12-18 12:13:02,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:13:02,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14583 states. [2019-12-18 12:13:02,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14583 to 13602. [2019-12-18 12:13:02,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13602 states. [2019-12-18 12:13:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13602 states to 13602 states and 43696 transitions. [2019-12-18 12:13:02,798 INFO L78 Accepts]: Start accepts. Automaton has 13602 states and 43696 transitions. Word has length 39 [2019-12-18 12:13:02,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:13:02,798 INFO L462 AbstractCegarLoop]: Abstraction has 13602 states and 43696 transitions. [2019-12-18 12:13:02,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:13:02,798 INFO L276 IsEmpty]: Start isEmpty. Operand 13602 states and 43696 transitions. [2019-12-18 12:13:02,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 12:13:02,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:13:02,815 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] [2019-12-18 12:13:02,816 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:13:02,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:13:02,816 INFO L82 PathProgramCache]: Analyzing trace with hash 654156702, now seen corresponding path program 1 times [2019-12-18 12:13:02,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:13:02,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076406148] [2019-12-18 12:13:02,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:13:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:13:02,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:13:02,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076406148] [2019-12-18 12:13:02,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:13:02,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:13:02,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187418109] [2019-12-18 12:13:02,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:13:02,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:13:02,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:13:02,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:13:02,875 INFO L87 Difference]: Start difference. First operand 13602 states and 43696 transitions. Second operand 4 states. [2019-12-18 12:13:02,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:13:02,951 INFO L93 Difference]: Finished difference Result 15351 states and 48207 transitions. [2019-12-18 12:13:02,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:13:02,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-18 12:13:02,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:13:02,980 INFO L225 Difference]: With dead ends: 15351 [2019-12-18 12:13:02,981 INFO L226 Difference]: Without dead ends: 13614 [2019-12-18 12:13:02,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:13:03,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13614 states. [2019-12-18 12:13:03,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13614 to 13597. [2019-12-18 12:13:03,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13597 states. [2019-12-18 12:13:03,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13597 states to 13597 states and 43565 transitions. [2019-12-18 12:13:03,186 INFO L78 Accepts]: Start accepts. Automaton has 13597 states and 43565 transitions. Word has length 50 [2019-12-18 12:13:03,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:13:03,187 INFO L462 AbstractCegarLoop]: Abstraction has 13597 states and 43565 transitions. [2019-12-18 12:13:03,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:13:03,187 INFO L276 IsEmpty]: Start isEmpty. Operand 13597 states and 43565 transitions. [2019-12-18 12:13:03,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 12:13:03,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:13:03,203 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] [2019-12-18 12:13:03,203 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:13:03,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:13:03,203 INFO L82 PathProgramCache]: Analyzing trace with hash -583724662, now seen corresponding path program 2 times [2019-12-18 12:13:03,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:13:03,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231527240] [2019-12-18 12:13:03,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:13:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:13:03,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:13:03,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231527240] [2019-12-18 12:13:03,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:13:03,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:13:03,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733984082] [2019-12-18 12:13:03,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:13:03,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:13:03,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:13:03,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:13:03,263 INFO L87 Difference]: Start difference. First operand 13597 states and 43565 transitions. Second operand 4 states. [2019-12-18 12:13:03,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:13:03,359 INFO L93 Difference]: Finished difference Result 20602 states and 61329 transitions. [2019-12-18 12:13:03,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:13:03,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-18 12:13:03,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:13:03,371 INFO L225 Difference]: With dead ends: 20602 [2019-12-18 12:13:03,371 INFO L226 Difference]: Without dead ends: 7379 [2019-12-18 12:13:03,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:13:03,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7379 states. [2019-12-18 12:13:03,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7379 to 7379. [2019-12-18 12:13:03,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7379 states. [2019-12-18 12:13:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7379 states to 7379 states and 18683 transitions. [2019-12-18 12:13:03,526 INFO L78 Accepts]: Start accepts. Automaton has 7379 states and 18683 transitions. Word has length 50 [2019-12-18 12:13:03,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:13:03,526 INFO L462 AbstractCegarLoop]: Abstraction has 7379 states and 18683 transitions. [2019-12-18 12:13:03,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:13:03,527 INFO L276 IsEmpty]: Start isEmpty. Operand 7379 states and 18683 transitions. [2019-12-18 12:13:03,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 12:13:03,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:13:03,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:13:03,540 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:13:03,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:13:03,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2055850628, now seen corresponding path program 3 times [2019-12-18 12:13:03,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:13:03,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454973849] [2019-12-18 12:13:03,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:13:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:13:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:13:03,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454973849] [2019-12-18 12:13:03,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:13:03,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:13:03,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417452663] [2019-12-18 12:13:03,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:13:03,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:13:03,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:13:03,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:13:03,707 INFO L87 Difference]: Start difference. First operand 7379 states and 18683 transitions. Second operand 7 states. [2019-12-18 12:13:03,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:13:03,821 INFO L93 Difference]: Finished difference Result 6193 states and 15946 transitions. [2019-12-18 12:13:03,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:13:03,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-18 12:13:03,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:13:03,822 INFO L225 Difference]: With dead ends: 6193 [2019-12-18 12:13:03,822 INFO L226 Difference]: Without dead ends: 484 [2019-12-18 12:13:03,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:13:03,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-12-18 12:13:03,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2019-12-18 12:13:03,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-12-18 12:13:03,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1060 transitions. [2019-12-18 12:13:03,829 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1060 transitions. Word has length 50 [2019-12-18 12:13:03,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:13:03,829 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 1060 transitions. [2019-12-18 12:13:03,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:13:03,830 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1060 transitions. [2019-12-18 12:13:03,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:13:03,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:13:03,831 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] [2019-12-18 12:13:03,831 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:13:03,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:13:03,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1736859180, now seen corresponding path program 1 times [2019-12-18 12:13:03,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:13:03,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838883106] [2019-12-18 12:13:03,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:13:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:13:03,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:13:03,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838883106] [2019-12-18 12:13:03,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:13:03,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:13:03,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12211013] [2019-12-18 12:13:03,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:13:03,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:13:03,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:13:03,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:13:03,916 INFO L87 Difference]: Start difference. First operand 484 states and 1060 transitions. Second operand 7 states. [2019-12-18 12:13:04,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:13:04,081 INFO L93 Difference]: Finished difference Result 989 states and 2130 transitions. [2019-12-18 12:13:04,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:13:04,081 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 12:13:04,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:13:04,083 INFO L225 Difference]: With dead ends: 989 [2019-12-18 12:13:04,083 INFO L226 Difference]: Without dead ends: 738 [2019-12-18 12:13:04,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:13:04,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-18 12:13:04,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 550. [2019-12-18 12:13:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-12-18 12:13:04,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1179 transitions. [2019-12-18 12:13:04,094 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1179 transitions. Word has length 66 [2019-12-18 12:13:04,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:13:04,095 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 1179 transitions. [2019-12-18 12:13:04,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:13:04,095 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1179 transitions. [2019-12-18 12:13:04,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:13:04,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:13:04,096 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] [2019-12-18 12:13:04,096 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:13:04,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:13:04,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1869585708, now seen corresponding path program 2 times [2019-12-18 12:13:04,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:13:04,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884841340] [2019-12-18 12:13:04,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:13:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:13:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:13:05,146 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:13:05,147 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:13:05,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_86| 0 0))) (and (= v_~z$r_buff0_thd1~0_96 0) (= 0 v_~z$mem_tmp~0_203) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff1_thd1~0_165 0) (= v_~main$tmp_guard1~0_48 0) (= 0 v_~z$flush_delayed~0_235) (= 0 v_~__unbuffered_p1_EAX~0_61) (= |v_#memory_int_29| (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t133~0.base_40| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t133~0.base_40|) |v_ULTIMATE.start_main_~#t133~0.offset_26| 0))) (= 0 v_~z$r_buff0_thd4~0_512) (= 0 v_~__unbuffered_p3_EBX~0_56) (= 0 v_~z$r_buff0_thd3~0_418) (= v_~a~0_28 0) (= v_~z$w_buff0_used~0_907 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~weak$$choice2~0_286 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p3_EAX~0_62) (= 0 |v_ULTIMATE.start_main_~#t133~0.offset_26|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t133~0.base_40|)) (= v_~z$w_buff0~0_341 0) (= v_~y~0_56 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t133~0.base_40|) (= 0 v_~__unbuffered_p2_EAX~0_71) (= v_~z$read_delayed~0_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t133~0.base_40| 1) |v_#valid_84|) (= v_~z$r_buff0_thd0~0_165 0) (= v_~__unbuffered_p2_EBX~0_75 0) (= v_~z$r_buff1_thd0~0_251 0) (= |v_#NULL.offset_5| 0) (= 0 v_~z$r_buff1_thd3~0_405) (= v_~z$r_buff0_thd2~0_96 0) (= 0 v_~weak$$choice0~0_191) (= v_~__unbuffered_cnt~0_139 0) (= v_~z$w_buff1~0_234 0) (= v_~x~0_74 0) (= v_~z$w_buff1_used~0_667 0) (= v_~z$r_buff1_thd2~0_165 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t133~0.base_40| 4)) (= 0 |v_#NULL.base_5|) (= 0 v_~z$r_buff1_thd4~0_334) (= v_~z~0_304 0) (= v_~main$tmp_guard0~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_96|, ~a~0=v_~a~0_28, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_165, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_61, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_512, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_62, ULTIMATE.start_main_~#t135~0.base=|v_ULTIMATE.start_main_~#t135~0.base_23|, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_71, ULTIMATE.start_main_~#t134~0.offset=|v_ULTIMATE.start_main_~#t134~0.offset_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_203, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_75, ULTIMATE.start_main_~#t136~0.base=|v_ULTIMATE.start_main_~#t136~0.base_24|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_667, ~z$flush_delayed~0=v_~z$flush_delayed~0_235, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_191, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_206|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_165, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_418, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ULTIMATE.start_main_~#t136~0.offset=|v_ULTIMATE.start_main_~#t136~0.offset_18|, ~x~0=v_~x~0_74, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_334, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ULTIMATE.start_main_~#t135~0.offset=|v_ULTIMATE.start_main_~#t135~0.offset_18|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_234, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_251, ~y~0=v_~y~0_56, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_96, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_907, ~z$w_buff0~0=v_~z$w_buff0~0_341, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_68|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_37, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_56, ULTIMATE.start_main_~#t133~0.base=|v_ULTIMATE.start_main_~#t133~0.base_40|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t133~0.offset=|v_ULTIMATE.start_main_~#t133~0.offset_26|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_80|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_97|, ULTIMATE.start_main_~#t134~0.base=|v_ULTIMATE.start_main_~#t134~0.base_32|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_304, ~weak$$choice2~0=v_~weak$$choice2~0_286, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_96} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t135~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t134~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t136~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t136~0.offset, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t135~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t133~0.base, #NULL.base, ULTIMATE.start_main_~#t133~0.offset, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t134~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:13:05,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] L856-1-->L858: Formula: (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t134~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t134~0.base_11|) |v_ULTIMATE.start_main_~#t134~0.offset_10| 1)) |v_#memory_int_19|) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t134~0.base_11| 1)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t134~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t134~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t134~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t134~0.base_11|)) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t134~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t134~0.base=|v_ULTIMATE.start_main_~#t134~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_19|, #length=|v_#length_19|, ULTIMATE.start_main_~#t134~0.offset=|v_ULTIMATE.start_main_~#t134~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t134~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t134~0.offset] because there is no mapped edge [2019-12-18 12:13:05,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L858-1-->L860: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t135~0.offset_11|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t135~0.base_12|) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t135~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t135~0.base_12|) |v_ULTIMATE.start_main_~#t135~0.offset_11| 2))) (not (= |v_ULTIMATE.start_main_~#t135~0.base_12| 0)) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t135~0.base_12|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t135~0.base_12| 4)) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t135~0.base_12| 1) |v_#valid_48|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_48|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t135~0.offset=|v_ULTIMATE.start_main_~#t135~0.offset_11|, ULTIMATE.start_main_~#t135~0.base=|v_ULTIMATE.start_main_~#t135~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t135~0.offset, ULTIMATE.start_main_~#t135~0.base, #length] because there is no mapped edge [2019-12-18 12:13:05,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L860-1-->L862: Formula: (and (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t136~0.base_13| 4) |v_#length_23|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t136~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t136~0.base_13|) |v_ULTIMATE.start_main_~#t136~0.offset_11| 3)) |v_#memory_int_23|) (= 0 |v_ULTIMATE.start_main_~#t136~0.offset_11|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t136~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t136~0.base_13|)) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t136~0.base_13| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t136~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ULTIMATE.start_main_~#t136~0.base=|v_ULTIMATE.start_main_~#t136~0.base_13|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|, ULTIMATE.start_main_~#t136~0.offset=|v_ULTIMATE.start_main_~#t136~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t136~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t136~0.offset] because there is no mapped edge [2019-12-18 12:13:05,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] P3ENTRY-->L4-3: Formula: (and (= v_P3Thread1of1ForFork2_~arg.base_9 |v_P3Thread1of1ForFork2_#in~arg.base_9|) (= |v_P3Thread1of1ForFork2_#in~arg.offset_9| v_P3Thread1of1ForFork2_~arg.offset_9) (= 1 v_~z$w_buff0~0_34) (= 1 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_9|) (= v_~z$w_buff0~0_35 v_~z$w_buff1~0_22) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_11 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_9|) (= v_~z$w_buff0_used~0_106 v_~z$w_buff1_used~0_57) (= (mod v_~z$w_buff1_used~0_57 256) 0) (= v_~z$w_buff0_used~0_105 1)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~z$w_buff0~0=v_~z$w_buff0~0_35, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_11, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, ~z$w_buff1~0=v_~z$w_buff1~0_22, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_9|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_9, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 12:13:05,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L818-2-->L818-5: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-524841397 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-524841397 256) 0)) (.cse2 (= |P3Thread1of1ForFork2_#t~ite29_Out-524841397| |P3Thread1of1ForFork2_#t~ite28_Out-524841397|))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out-524841397| ~z$w_buff1~0_In-524841397) (or .cse0 .cse1) .cse2) (and (not .cse0) (not .cse1) .cse2 (= ~z$w_buff0~0_In-524841397 |P3Thread1of1ForFork2_#t~ite28_Out-524841397|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-524841397, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-524841397, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-524841397, ~z$w_buff1~0=~z$w_buff1~0_In-524841397} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-524841397|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-524841397|, ~z$w_buff0~0=~z$w_buff0~0_In-524841397, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-524841397, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-524841397, ~z$w_buff1~0=~z$w_buff1~0_In-524841397} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 12:13:05,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_105 v_~z$r_buff0_thd4~0_104) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_68} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_8|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_11|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_11|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 12:13:05,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1263543015 256)))) (or (and .cse0 (= |P3Thread1of1ForFork2_#t~ite48_Out1263543015| ~z~0_In1263543015)) (and (= |P3Thread1of1ForFork2_#t~ite48_Out1263543015| ~z$mem_tmp~0_In1263543015) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1263543015, ~z$flush_delayed~0=~z$flush_delayed~0_In1263543015, ~z~0=~z~0_In1263543015} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1263543015, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out1263543015|, ~z$flush_delayed~0=~z$flush_delayed~0_In1263543015, ~z~0=~z~0_In1263543015} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-18 12:13:05,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_16 1) (= v_~x~0_21 1) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_10|) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_10)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_16, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-18 12:13:05,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x~0_18 2) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~y~0_31 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, ~y~0=v_~y~0_31} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_31, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-18 12:13:05,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1554690453 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite25_Out-1554690453| ~z~0_In-1554690453) .cse0) (and (= ~z$mem_tmp~0_In-1554690453 |P2Thread1of1ForFork1_#t~ite25_Out-1554690453|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1554690453, ~z$flush_delayed~0=~z$flush_delayed~0_In-1554690453, ~z~0=~z~0_In-1554690453} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1554690453, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-1554690453|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1554690453, ~z~0=~z~0_In-1554690453} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-18 12:13:05,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-491769565 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-491769565 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork2_#t~ite51_Out-491769565|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-491769565 |P3Thread1of1ForFork2_#t~ite51_Out-491769565|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-491769565, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-491769565} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-491769565|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-491769565, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-491769565} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-18 12:13:05,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L835-->L835-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd4~0_In-1936908971 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1936908971 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1936908971 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-1936908971 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite52_Out-1936908971| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P3Thread1of1ForFork2_#t~ite52_Out-1936908971| ~z$w_buff1_used~0_In-1936908971)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1936908971, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1936908971, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1936908971, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1936908971} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1936908971|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1936908971, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1936908971, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1936908971, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1936908971} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-18 12:13:05,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L837: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-786601341 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-786601341 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out-786601341 ~z$r_buff0_thd4~0_In-786601341) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out-786601341 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-786601341, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-786601341} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-786601341|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-786601341, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-786601341} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 12:13:05,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In383204643 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In383204643 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In383204643 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In383204643 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite54_Out383204643| ~z$r_buff1_thd4~0_In383204643) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P3Thread1of1ForFork2_#t~ite54_Out383204643|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In383204643, ~z$w_buff0_used~0=~z$w_buff0_used~0_In383204643, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In383204643, ~z$w_buff1_used~0=~z$w_buff1_used~0_In383204643} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out383204643|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In383204643, ~z$w_buff0_used~0=~z$w_buff0_used~0_In383204643, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In383204643, ~z$w_buff1_used~0=~z$w_buff1_used~0_In383204643} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-18 12:13:05,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L837-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= |v_P3Thread1of1ForFork2_#t~ite54_32| v_~z$r_buff1_thd4~0_260) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_31|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:13:05,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 v_~z$flush_delayed~0_189) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~z~0_189 |v_P2Thread1of1ForFork1_#t~ite25_46|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_45|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_189, ~z~0=v_~z~0_189, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 12:13:05,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [908] [908] L866-->L868-2: Formula: (and (or (= (mod v_~z$w_buff0_used~0_107 256) 0) (= 0 (mod v_~z$r_buff0_thd0~0_14 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 12:13:05,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L868-2-->L868-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite60_Out-1832586049| |ULTIMATE.start_main_#t~ite59_Out-1832586049|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1832586049 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1832586049 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= ~z$w_buff1~0_In-1832586049 |ULTIMATE.start_main_#t~ite59_Out-1832586049|)) (and .cse1 (or .cse2 .cse0) (= ~z~0_In-1832586049 |ULTIMATE.start_main_#t~ite59_Out-1832586049|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1832586049, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1832586049, ~z$w_buff1~0=~z$w_buff1~0_In-1832586049, ~z~0=~z~0_In-1832586049} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1832586049|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1832586049, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1832586049, ~z$w_buff1~0=~z$w_buff1~0_In-1832586049, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1832586049|, ~z~0=~z~0_In-1832586049} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 12:13:05,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L869-->L869-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-767905497 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-767905497 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite61_Out-767905497| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite61_Out-767905497| ~z$w_buff0_used~0_In-767905497) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-767905497, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-767905497} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-767905497, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-767905497|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-767905497} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 12:13:05,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L870-->L870-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1342409851 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1342409851 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1342409851 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1342409851 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1342409851 |ULTIMATE.start_main_#t~ite62_Out-1342409851|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out-1342409851|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1342409851, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1342409851, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1342409851, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1342409851} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1342409851|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1342409851, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1342409851, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1342409851, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1342409851} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 12:13:05,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L871-->L871-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In778590396 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In778590396 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In778590396 |ULTIMATE.start_main_#t~ite63_Out778590396|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite63_Out778590396|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In778590396, ~z$w_buff0_used~0=~z$w_buff0_used~0_In778590396} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out778590396|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In778590396, ~z$w_buff0_used~0=~z$w_buff0_used~0_In778590396} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-18 12:13:05,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L872-->L872-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1898805701 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1898805701 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1898805701 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1898805701 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out1898805701| ~z$r_buff1_thd0~0_In1898805701) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite64_Out1898805701| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1898805701, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1898805701, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1898805701, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1898805701} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1898805701, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1898805701, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1898805701, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1898805701, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1898805701|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-18 12:13:05,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p3_EAX~0_28) (= 0 v_~__unbuffered_p1_EAX~0_27) (= v_~main$tmp_guard1~0_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_18 256)) (= 1 v_~__unbuffered_p2_EAX~0_41) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~__unbuffered_p2_EBX~0_43 0) (= v_~x~0_36 2) (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite64_41|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:13:05,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:13:05 BasicIcfg [2019-12-18 12:13:05,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:13:05,362 INFO L168 Benchmark]: Toolchain (without parser) took 165979.48 ms. Allocated memory was 144.2 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 99.9 MB in the beginning and 2.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-18 12:13:05,365 INFO L168 Benchmark]: CDTParser took 0.23 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: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 12:13:05,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.99 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 153.2 MB in the end (delta: -53.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-18 12:13:05,366 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.40 ms. Allocated memory is still 201.3 MB. Free memory was 153.2 MB in the beginning and 150.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:13:05,367 INFO L168 Benchmark]: Boogie Preprocessor took 42.26 ms. Allocated memory is still 201.3 MB. Free memory was 150.4 MB in the beginning and 147.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:13:05,367 INFO L168 Benchmark]: RCFGBuilder took 955.03 ms. Allocated memory is still 201.3 MB. Free memory was 147.7 MB in the beginning and 89.8 MB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:13:05,369 INFO L168 Benchmark]: TraceAbstraction took 164121.33 ms. Allocated memory was 201.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 89.1 MB in the beginning and 2.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-18 12:13:05,373 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.23 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: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.99 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 153.2 MB in the end (delta: -53.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.40 ms. Allocated memory is still 201.3 MB. Free memory was 153.2 MB in the beginning and 150.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.26 ms. Allocated memory is still 201.3 MB. Free memory was 150.4 MB in the beginning and 147.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 955.03 ms. Allocated memory is still 201.3 MB. Free memory was 147.7 MB in the beginning and 89.8 MB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 164121.33 ms. Allocated memory was 201.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 89.1 MB in the beginning and 2.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.3s, 212 ProgramPointsBefore, 112 ProgramPointsAfterwards, 255 TransitionsBefore, 132 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 28 ChoiceCompositions, 11185 VarBasedMoverChecksPositive, 319 VarBasedMoverChecksNegative, 81 SemBasedMoverChecksPositive, 338 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 0 MoverChecksTotal, 141939 CheckedPairsTotal, 133 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L856] FCALL, FORK 0 pthread_create(&t133, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] FCALL, FORK 0 pthread_create(&t134, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] FCALL, FORK 0 pthread_create(&t135, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] FCALL, FORK 0 pthread_create(&t136, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L807] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L808] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L809] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L810] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L811] 4 z$r_buff0_thd4 = (_Bool)1 [L814] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 4 z$flush_delayed = weak$$choice2 [L817] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L819] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L820] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L821] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L822] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z = z$flush_delayed ? z$mem_tmp : z [L827] 4 z$flush_delayed = (_Bool)0 [L830] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 __unbuffered_p2_EAX = y [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 z$flush_delayed = weak$$choice2 [L779] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L781] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L782] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L783] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L784] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L786] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L834] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L864] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L869] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L871] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 2 error locations. Result: UNSAFE, OverallTime: 163.7s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 56.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4274 SDtfs, 6904 SDslu, 9391 SDs, 0 SdLazy, 3109 SolverSat, 199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=193200occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 86.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 196266 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 657 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 573 ConstructedInterpolants, 0 QuantifiedInterpolants, 75873 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...