/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:53:25,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:53:25,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:53:25,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:53:25,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:53:25,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:53:25,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:53:25,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:53:25,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:53:25,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:53:25,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:53:25,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:53:25,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:53:25,096 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:53:25,097 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:53:25,098 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:53:25,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:53:25,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:53:25,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:53:25,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:53:25,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:53:25,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:53:25,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:53:25,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:53:25,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:53:25,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:53:25,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:53:25,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:53:25,112 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:53:25,113 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:53:25,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:53:25,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:53:25,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:53:25,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:53:25,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:53:25,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:53:25,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:53:25,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:53:25,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:53:25,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:53:25,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:53:25,120 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 15:53:25,135 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:53:25,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:53:25,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:53:25,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:53:25,136 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:53:25,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:53:25,137 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:53:25,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:53:25,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:53:25,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:53:25,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:53:25,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:53:25,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:53:25,138 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:53:25,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:53:25,139 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:53:25,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:53:25,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:53:25,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:53:25,140 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:53:25,140 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:53:25,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:53:25,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:53:25,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:53:25,141 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:53:25,141 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:53:25,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:53:25,141 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:53:25,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:53:25,141 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:53:25,142 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:53:25,403 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:53:25,420 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:53:25,424 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:53:25,426 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:53:25,427 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:53:25,429 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.opt.i [2019-12-27 15:53:25,493 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/666c1920d/e346624cd2804f7680a78584d4b13015/FLAG13dd2c81f [2019-12-27 15:53:26,027 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:53:26,028 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_tso.opt.i [2019-12-27 15:53:26,050 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/666c1920d/e346624cd2804f7680a78584d4b13015/FLAG13dd2c81f [2019-12-27 15:53:26,336 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/666c1920d/e346624cd2804f7680a78584d4b13015 [2019-12-27 15:53:26,346 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:53:26,348 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:53:26,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:53:26,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:53:26,353 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:53:26,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:53:26" (1/1) ... [2019-12-27 15:53:26,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b87bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:26, skipping insertion in model container [2019-12-27 15:53:26,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:53:26" (1/1) ... [2019-12-27 15:53:26,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:53:26,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:53:27,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:53:27,022 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:53:27,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:53:27,166 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:53:27,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:27 WrapperNode [2019-12-27 15:53:27,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:53:27,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:53:27,167 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:53:27,168 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:53:27,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:27" (1/1) ... [2019-12-27 15:53:27,212 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:27" (1/1) ... [2019-12-27 15:53:27,246 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:53:27,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:53:27,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:53:27,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:53:27,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:27" (1/1) ... [2019-12-27 15:53:27,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:27" (1/1) ... [2019-12-27 15:53:27,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:27" (1/1) ... [2019-12-27 15:53:27,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:27" (1/1) ... [2019-12-27 15:53:27,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:27" (1/1) ... [2019-12-27 15:53:27,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:27" (1/1) ... [2019-12-27 15:53:27,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:27" (1/1) ... [2019-12-27 15:53:27,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:53:27,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:53:27,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:53:27,289 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:53:27,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:53:27,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:53:27,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:53:27,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:53:27,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:53:27,355 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:53:27,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:53:27,356 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:53:27,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:53:27,356 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 15:53:27,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 15:53:27,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:53:27,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:53:27,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:53:27,359 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 15:53:28,184 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:53:28,184 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:53:28,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:53:28 BoogieIcfgContainer [2019-12-27 15:53:28,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:53:28,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:53:28,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:53:28,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:53:28,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:53:26" (1/3) ... [2019-12-27 15:53:28,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca5577b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:53:28, skipping insertion in model container [2019-12-27 15:53:28,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:27" (2/3) ... [2019-12-27 15:53:28,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca5577b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:53:28, skipping insertion in model container [2019-12-27 15:53:28,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:53:28" (3/3) ... [2019-12-27 15:53:28,194 INFO L109 eAbstractionObserver]: Analyzing ICFG mix011_tso.opt.i [2019-12-27 15:53:28,204 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:53:28,205 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:53:28,212 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:53:28,213 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:53:28,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,271 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,271 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,274 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,274 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,294 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,295 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,295 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,295 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,296 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,323 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,324 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,326 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,332 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,332 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,336 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,338 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:28,354 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 15:53:28,374 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:53:28,374 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:53:28,374 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:53:28,374 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:53:28,374 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:53:28,375 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:53:28,375 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:53:28,375 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:53:28,390 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 242 transitions [2019-12-27 15:53:28,392 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-27 15:53:28,511 INFO L132 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-27 15:53:28,511 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:53:28,531 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 565 event pairs. 0/181 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 15:53:28,562 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-27 15:53:28,623 INFO L132 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-27 15:53:28,623 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:53:28,635 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 565 event pairs. 0/181 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 15:53:28,669 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-27 15:53:28,670 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:53:34,745 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 15:53:34,882 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 15:53:35,150 INFO L206 etLargeBlockEncoding]: Checked pairs total: 115591 [2019-12-27 15:53:35,150 INFO L214 etLargeBlockEncoding]: Total number of compositions: 128 [2019-12-27 15:53:35,155 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 122 transitions [2019-12-27 15:53:38,627 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 39870 states. [2019-12-27 15:53:38,629 INFO L276 IsEmpty]: Start isEmpty. Operand 39870 states. [2019-12-27 15:53:38,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 15:53:38,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:38,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:53:38,636 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:38,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:38,641 INFO L82 PathProgramCache]: Analyzing trace with hash 191430122, now seen corresponding path program 1 times [2019-12-27 15:53:38,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:38,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693246447] [2019-12-27 15:53:38,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:38,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693246447] [2019-12-27 15:53:38,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:38,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:53:38,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [814939263] [2019-12-27 15:53:38,989 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:38,995 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:39,011 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 15:53:39,012 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:39,016 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:53:39,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:53:39,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:39,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:53:39,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:53:39,034 INFO L87 Difference]: Start difference. First operand 39870 states. Second operand 3 states. [2019-12-27 15:53:39,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:39,820 INFO L93 Difference]: Finished difference Result 39574 states and 160408 transitions. [2019-12-27 15:53:39,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:53:39,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 15:53:39,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:40,266 INFO L225 Difference]: With dead ends: 39574 [2019-12-27 15:53:40,266 INFO L226 Difference]: Without dead ends: 36868 [2019-12-27 15:53:40,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:53:41,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36868 states. [2019-12-27 15:53:42,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36868 to 36868. [2019-12-27 15:53:42,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36868 states. [2019-12-27 15:53:42,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36868 states to 36868 states and 149325 transitions. [2019-12-27 15:53:42,529 INFO L78 Accepts]: Start accepts. Automaton has 36868 states and 149325 transitions. Word has length 7 [2019-12-27 15:53:42,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:42,530 INFO L462 AbstractCegarLoop]: Abstraction has 36868 states and 149325 transitions. [2019-12-27 15:53:42,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:53:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 36868 states and 149325 transitions. [2019-12-27 15:53:42,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 15:53:42,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:42,545 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:53:42,547 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:42,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:42,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1210424527, now seen corresponding path program 1 times [2019-12-27 15:53:42,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:42,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654042647] [2019-12-27 15:53:42,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:42,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:42,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654042647] [2019-12-27 15:53:42,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:42,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:53:42,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [928717304] [2019-12-27 15:53:42,697 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:42,698 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:42,702 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 15:53:42,702 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:42,702 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:53:42,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:53:42,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:42,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:53:42,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:53:42,704 INFO L87 Difference]: Start difference. First operand 36868 states and 149325 transitions. Second operand 4 states. [2019-12-27 15:53:45,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:45,071 INFO L93 Difference]: Finished difference Result 58688 states and 229341 transitions. [2019-12-27 15:53:45,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:53:45,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 15:53:45,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:45,399 INFO L225 Difference]: With dead ends: 58688 [2019-12-27 15:53:45,399 INFO L226 Difference]: Without dead ends: 58658 [2019-12-27 15:53:45,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:53:46,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58658 states. [2019-12-27 15:53:47,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58658 to 56314. [2019-12-27 15:53:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56314 states. [2019-12-27 15:53:48,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56314 states to 56314 states and 221696 transitions. [2019-12-27 15:53:48,125 INFO L78 Accepts]: Start accepts. Automaton has 56314 states and 221696 transitions. Word has length 13 [2019-12-27 15:53:48,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:48,125 INFO L462 AbstractCegarLoop]: Abstraction has 56314 states and 221696 transitions. [2019-12-27 15:53:48,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:53:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 56314 states and 221696 transitions. [2019-12-27 15:53:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:53:48,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:48,130 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:53:48,130 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:48,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:48,131 INFO L82 PathProgramCache]: Analyzing trace with hash -2049494264, now seen corresponding path program 1 times [2019-12-27 15:53:48,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:48,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350054803] [2019-12-27 15:53:48,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:48,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350054803] [2019-12-27 15:53:48,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:48,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:53:48,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1624644974] [2019-12-27 15:53:48,193 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:48,195 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:48,198 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 15:53:48,198 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:48,200 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:53:48,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:53:48,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:48,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:53:48,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:53:48,200 INFO L87 Difference]: Start difference. First operand 56314 states and 221696 transitions. Second operand 4 states. [2019-12-27 15:53:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:48,801 INFO L93 Difference]: Finished difference Result 73686 states and 285874 transitions. [2019-12-27 15:53:48,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:53:48,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 15:53:48,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:51,599 INFO L225 Difference]: With dead ends: 73686 [2019-12-27 15:53:51,599 INFO L226 Difference]: Without dead ends: 73656 [2019-12-27 15:53:51,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:53:52,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73656 states. [2019-12-27 15:53:53,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73656 to 64544. [2019-12-27 15:53:53,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64544 states. [2019-12-27 15:53:53,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64544 states to 64544 states and 252987 transitions. [2019-12-27 15:53:53,755 INFO L78 Accepts]: Start accepts. Automaton has 64544 states and 252987 transitions. Word has length 16 [2019-12-27 15:53:53,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:53,756 INFO L462 AbstractCegarLoop]: Abstraction has 64544 states and 252987 transitions. [2019-12-27 15:53:53,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:53:53,756 INFO L276 IsEmpty]: Start isEmpty. Operand 64544 states and 252987 transitions. [2019-12-27 15:53:53,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 15:53:53,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:53,765 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-27 15:53:53,765 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:53,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:53,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1983670654, now seen corresponding path program 1 times [2019-12-27 15:53:53,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:53,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813353247] [2019-12-27 15:53:53,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:53,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:53,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813353247] [2019-12-27 15:53:53,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:53,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:53:53,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [83304819] [2019-12-27 15:53:53,841 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:53,843 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:53,845 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 20 transitions. [2019-12-27 15:53:53,846 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:53,846 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:53:53,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:53:53,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:53,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:53:53,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:53:53,847 INFO L87 Difference]: Start difference. First operand 64544 states and 252987 transitions. Second operand 3 states. [2019-12-27 15:53:54,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:54,571 INFO L93 Difference]: Finished difference Result 64378 states and 252374 transitions. [2019-12-27 15:53:54,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:53:54,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 15:53:54,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:54,827 INFO L225 Difference]: With dead ends: 64378 [2019-12-27 15:53:54,827 INFO L226 Difference]: Without dead ends: 64378 [2019-12-27 15:53:54,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:53:55,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64378 states. [2019-12-27 15:53:58,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64378 to 64378. [2019-12-27 15:53:58,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64378 states. [2019-12-27 15:53:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64378 states to 64378 states and 252374 transitions. [2019-12-27 15:53:58,944 INFO L78 Accepts]: Start accepts. Automaton has 64378 states and 252374 transitions. Word has length 18 [2019-12-27 15:53:58,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:58,945 INFO L462 AbstractCegarLoop]: Abstraction has 64378 states and 252374 transitions. [2019-12-27 15:53:58,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:53:58,945 INFO L276 IsEmpty]: Start isEmpty. Operand 64378 states and 252374 transitions. [2019-12-27 15:53:58,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 15:53:58,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:58,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:53:58,957 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:58,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:58,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1589508715, now seen corresponding path program 1 times [2019-12-27 15:53:58,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:58,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642553874] [2019-12-27 15:53:58,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:59,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642553874] [2019-12-27 15:53:59,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:59,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:53:59,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1494981152] [2019-12-27 15:53:59,024 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:59,027 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:59,030 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 34 transitions. [2019-12-27 15:53:59,030 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:59,030 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:53:59,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:53:59,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:59,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:53:59,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:53:59,032 INFO L87 Difference]: Start difference. First operand 64378 states and 252374 transitions. Second operand 3 states. [2019-12-27 15:53:59,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:59,731 INFO L93 Difference]: Finished difference Result 60640 states and 237307 transitions. [2019-12-27 15:53:59,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:53:59,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-27 15:53:59,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:59,870 INFO L225 Difference]: With dead ends: 60640 [2019-12-27 15:53:59,870 INFO L226 Difference]: Without dead ends: 60640 [2019-12-27 15:53:59,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:54:00,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60640 states. [2019-12-27 15:54:03,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60640 to 60640. [2019-12-27 15:54:03,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60640 states. [2019-12-27 15:54:03,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60640 states to 60640 states and 237307 transitions. [2019-12-27 15:54:03,761 INFO L78 Accepts]: Start accepts. Automaton has 60640 states and 237307 transitions. Word has length 19 [2019-12-27 15:54:03,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:03,761 INFO L462 AbstractCegarLoop]: Abstraction has 60640 states and 237307 transitions. [2019-12-27 15:54:03,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:54:03,761 INFO L276 IsEmpty]: Start isEmpty. Operand 60640 states and 237307 transitions. [2019-12-27 15:54:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 15:54:03,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:03,781 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-27 15:54:03,781 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:03,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:03,781 INFO L82 PathProgramCache]: Analyzing trace with hash 84396495, now seen corresponding path program 1 times [2019-12-27 15:54:03,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:03,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769202515] [2019-12-27 15:54:03,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:03,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:54:03,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769202515] [2019-12-27 15:54:03,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:03,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:54:03,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1893598531] [2019-12-27 15:54:03,855 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:03,859 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:03,865 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 76 transitions. [2019-12-27 15:54:03,865 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:03,866 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:54:03,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:54:03,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:03,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:54:03,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:54:03,867 INFO L87 Difference]: Start difference. First operand 60640 states and 237307 transitions. Second operand 5 states. [2019-12-27 15:54:04,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:04,750 INFO L93 Difference]: Finished difference Result 73008 states and 281971 transitions. [2019-12-27 15:54:04,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:54:04,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 15:54:04,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:05,495 INFO L225 Difference]: With dead ends: 73008 [2019-12-27 15:54:05,495 INFO L226 Difference]: Without dead ends: 72954 [2019-12-27 15:54:05,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:54:06,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72954 states. [2019-12-27 15:54:09,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72954 to 60474. [2019-12-27 15:54:09,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60474 states. [2019-12-27 15:54:10,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60474 states to 60474 states and 236710 transitions. [2019-12-27 15:54:10,092 INFO L78 Accepts]: Start accepts. Automaton has 60474 states and 236710 transitions. Word has length 22 [2019-12-27 15:54:10,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:10,092 INFO L462 AbstractCegarLoop]: Abstraction has 60474 states and 236710 transitions. [2019-12-27 15:54:10,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:54:10,092 INFO L276 IsEmpty]: Start isEmpty. Operand 60474 states and 236710 transitions. [2019-12-27 15:54:10,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 15:54:10,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:10,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:54:10,160 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:10,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:10,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1678286889, now seen corresponding path program 1 times [2019-12-27 15:54:10,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:10,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849247831] [2019-12-27 15:54:10,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:10,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:54:10,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849247831] [2019-12-27 15:54:10,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:10,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:54:10,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [528414532] [2019-12-27 15:54:10,231 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:10,237 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:10,248 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 48 transitions. [2019-12-27 15:54:10,248 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:10,251 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:54:10,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:54:10,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:10,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:54:10,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:54:10,252 INFO L87 Difference]: Start difference. First operand 60474 states and 236710 transitions. Second operand 3 states. [2019-12-27 15:54:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:10,538 INFO L93 Difference]: Finished difference Result 60474 states and 233922 transitions. [2019-12-27 15:54:10,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:54:10,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 15:54:10,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:10,675 INFO L225 Difference]: With dead ends: 60474 [2019-12-27 15:54:10,675 INFO L226 Difference]: Without dead ends: 60474 [2019-12-27 15:54:10,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:54:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60474 states. [2019-12-27 15:54:12,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60474 to 60154. [2019-12-27 15:54:12,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60154 states. [2019-12-27 15:54:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60154 states to 60154 states and 232834 transitions. [2019-12-27 15:54:12,421 INFO L78 Accepts]: Start accepts. Automaton has 60154 states and 232834 transitions. Word has length 33 [2019-12-27 15:54:12,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:12,422 INFO L462 AbstractCegarLoop]: Abstraction has 60154 states and 232834 transitions. [2019-12-27 15:54:12,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:54:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 60154 states and 232834 transitions. [2019-12-27 15:54:12,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 15:54:12,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:12,486 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] [2019-12-27 15:54:12,486 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:12,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:12,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1668508412, now seen corresponding path program 1 times [2019-12-27 15:54:12,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:12,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87907027] [2019-12-27 15:54:12,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:54:12,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87907027] [2019-12-27 15:54:12,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:12,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:54:12,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1051793788] [2019-12-27 15:54:12,600 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:12,608 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:12,628 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 101 transitions. [2019-12-27 15:54:12,628 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:12,652 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:54:12,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:54:12,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:12,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:54:12,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:54:12,654 INFO L87 Difference]: Start difference. First operand 60154 states and 232834 transitions. Second operand 7 states. [2019-12-27 15:54:14,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:14,476 INFO L93 Difference]: Finished difference Result 155268 states and 600597 transitions. [2019-12-27 15:54:14,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 15:54:14,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 15:54:14,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:14,806 INFO L225 Difference]: With dead ends: 155268 [2019-12-27 15:54:14,806 INFO L226 Difference]: Without dead ends: 129034 [2019-12-27 15:54:14,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-27 15:54:15,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129034 states. [2019-12-27 15:54:20,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129034 to 99256. [2019-12-27 15:54:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99256 states. [2019-12-27 15:54:21,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99256 states to 99256 states and 387623 transitions. [2019-12-27 15:54:21,469 INFO L78 Accepts]: Start accepts. Automaton has 99256 states and 387623 transitions. Word has length 34 [2019-12-27 15:54:21,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:21,469 INFO L462 AbstractCegarLoop]: Abstraction has 99256 states and 387623 transitions. [2019-12-27 15:54:21,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:54:21,470 INFO L276 IsEmpty]: Start isEmpty. Operand 99256 states and 387623 transitions. [2019-12-27 15:54:21,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 15:54:21,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:21,620 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] [2019-12-27 15:54:21,620 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:21,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:21,621 INFO L82 PathProgramCache]: Analyzing trace with hash 310200044, now seen corresponding path program 2 times [2019-12-27 15:54:21,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:21,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043198849] [2019-12-27 15:54:21,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:54:21,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043198849] [2019-12-27 15:54:21,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:21,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:54:21,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1893426997] [2019-12-27 15:54:21,816 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:21,822 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:21,842 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 141 transitions. [2019-12-27 15:54:21,842 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:21,996 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 15:54:21,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 15:54:21,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:21,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 15:54:21,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:54:21,998 INFO L87 Difference]: Start difference. First operand 99256 states and 387623 transitions. Second operand 15 states. [2019-12-27 15:54:35,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:35,995 INFO L93 Difference]: Finished difference Result 594676 states and 2319627 transitions. [2019-12-27 15:54:35,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 15:54:35,995 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-12-27 15:54:35,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:37,459 INFO L225 Difference]: With dead ends: 594676 [2019-12-27 15:54:37,459 INFO L226 Difference]: Without dead ends: 516560 [2019-12-27 15:54:37,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=713, Invalid=2149, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 15:54:40,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516560 states. [2019-12-27 15:54:45,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516560 to 124844. [2019-12-27 15:54:45,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124844 states. [2019-12-27 15:54:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124844 states to 124844 states and 492423 transitions. [2019-12-27 15:54:46,231 INFO L78 Accepts]: Start accepts. Automaton has 124844 states and 492423 transitions. Word has length 34 [2019-12-27 15:54:46,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:46,231 INFO L462 AbstractCegarLoop]: Abstraction has 124844 states and 492423 transitions. [2019-12-27 15:54:46,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 15:54:46,232 INFO L276 IsEmpty]: Start isEmpty. Operand 124844 states and 492423 transitions. [2019-12-27 15:54:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 15:54:46,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:46,404 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] [2019-12-27 15:54:46,404 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:46,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:46,404 INFO L82 PathProgramCache]: Analyzing trace with hash -2100031247, now seen corresponding path program 1 times [2019-12-27 15:54:46,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:46,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699691168] [2019-12-27 15:54:46,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:54:46,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699691168] [2019-12-27 15:54:46,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:46,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:54:46,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [906054212] [2019-12-27 15:54:46,473 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:46,479 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:46,507 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 173 transitions. [2019-12-27 15:54:46,508 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:46,525 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:54:46,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:54:46,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:46,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:54:46,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:54:46,527 INFO L87 Difference]: Start difference. First operand 124844 states and 492423 transitions. Second operand 5 states. [2019-12-27 15:54:48,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:48,573 INFO L93 Difference]: Finished difference Result 107100 states and 372068 transitions. [2019-12-27 15:54:48,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:54:48,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-27 15:54:48,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:48,788 INFO L225 Difference]: With dead ends: 107100 [2019-12-27 15:54:48,789 INFO L226 Difference]: Without dead ends: 99340 [2019-12-27 15:54:48,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:54:49,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99340 states. [2019-12-27 15:54:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99340 to 68090. [2019-12-27 15:54:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68090 states. [2019-12-27 15:54:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68090 states to 68090 states and 234573 transitions. [2019-12-27 15:54:50,337 INFO L78 Accepts]: Start accepts. Automaton has 68090 states and 234573 transitions. Word has length 35 [2019-12-27 15:54:50,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:50,338 INFO L462 AbstractCegarLoop]: Abstraction has 68090 states and 234573 transitions. [2019-12-27 15:54:50,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:54:50,338 INFO L276 IsEmpty]: Start isEmpty. Operand 68090 states and 234573 transitions. [2019-12-27 15:54:50,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 15:54:50,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:50,413 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-27 15:54:50,413 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:50,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:50,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1396410162, now seen corresponding path program 1 times [2019-12-27 15:54:50,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:50,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721082882] [2019-12-27 15:54:50,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:50,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:54:50,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721082882] [2019-12-27 15:54:50,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:50,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:54:50,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [40971066] [2019-12-27 15:54:50,480 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:50,487 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:52,919 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 204 transitions. [2019-12-27 15:54:52,920 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:52,940 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:54:52,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:54:52,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:52,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:54:52,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:54:52,942 INFO L87 Difference]: Start difference. First operand 68090 states and 234573 transitions. Second operand 6 states. [2019-12-27 15:54:53,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:53,160 INFO L93 Difference]: Finished difference Result 14388 states and 43690 transitions. [2019-12-27 15:54:53,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:54:53,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-12-27 15:54:53,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:53,178 INFO L225 Difference]: With dead ends: 14388 [2019-12-27 15:54:53,178 INFO L226 Difference]: Without dead ends: 10358 [2019-12-27 15:54:53,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:54:53,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10358 states. [2019-12-27 15:54:53,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10358 to 9395. [2019-12-27 15:54:53,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9395 states. [2019-12-27 15:54:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9395 states to 9395 states and 27325 transitions. [2019-12-27 15:54:53,295 INFO L78 Accepts]: Start accepts. Automaton has 9395 states and 27325 transitions. Word has length 36 [2019-12-27 15:54:53,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:53,296 INFO L462 AbstractCegarLoop]: Abstraction has 9395 states and 27325 transitions. [2019-12-27 15:54:53,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:54:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 9395 states and 27325 transitions. [2019-12-27 15:54:53,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 15:54:53,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:53,306 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] [2019-12-27 15:54:53,307 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:53,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:53,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1883380707, now seen corresponding path program 1 times [2019-12-27 15:54:53,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:53,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691622123] [2019-12-27 15:54:53,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:53,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:54:53,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691622123] [2019-12-27 15:54:53,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:53,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:54:53,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1455718261] [2019-12-27 15:54:53,413 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:53,424 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:53,462 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 95 transitions. [2019-12-27 15:54:53,462 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:53,463 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:54:53,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:54:53,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:53,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:54:53,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:54:53,465 INFO L87 Difference]: Start difference. First operand 9395 states and 27325 transitions. Second operand 4 states. [2019-12-27 15:54:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:53,534 INFO L93 Difference]: Finished difference Result 10422 states and 29638 transitions. [2019-12-27 15:54:53,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:54:53,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-27 15:54:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:53,555 INFO L225 Difference]: With dead ends: 10422 [2019-12-27 15:54:53,556 INFO L226 Difference]: Without dead ends: 9406 [2019-12-27 15:54:53,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:54:53,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9406 states. [2019-12-27 15:54:53,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9406 to 9387. [2019-12-27 15:54:53,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9387 states. [2019-12-27 15:54:53,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9387 states to 9387 states and 27237 transitions. [2019-12-27 15:54:53,765 INFO L78 Accepts]: Start accepts. Automaton has 9387 states and 27237 transitions. Word has length 47 [2019-12-27 15:54:53,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:53,765 INFO L462 AbstractCegarLoop]: Abstraction has 9387 states and 27237 transitions. [2019-12-27 15:54:53,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:54:53,766 INFO L276 IsEmpty]: Start isEmpty. Operand 9387 states and 27237 transitions. [2019-12-27 15:54:53,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 15:54:53,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:53,783 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] [2019-12-27 15:54:53,783 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:53,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:53,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1612037247, now seen corresponding path program 2 times [2019-12-27 15:54:53,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:53,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276767136] [2019-12-27 15:54:53,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:53,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:54:53,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276767136] [2019-12-27 15:54:53,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:53,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:54:53,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1389082690] [2019-12-27 15:54:53,865 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:53,876 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:53,916 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 72 transitions. [2019-12-27 15:54:53,916 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:53,917 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:54:53,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:54:53,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:53,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:54:53,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:54:53,918 INFO L87 Difference]: Start difference. First operand 9387 states and 27237 transitions. Second operand 3 states. [2019-12-27 15:54:53,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:53,974 INFO L93 Difference]: Finished difference Result 14605 states and 40059 transitions. [2019-12-27 15:54:53,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:54:53,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-27 15:54:53,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:53,994 INFO L225 Difference]: With dead ends: 14605 [2019-12-27 15:54:53,995 INFO L226 Difference]: Without dead ends: 9200 [2019-12-27 15:54:54,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:54:54,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9200 states. [2019-12-27 15:54:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9200 to 9145. [2019-12-27 15:54:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9145 states. [2019-12-27 15:54:54,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9145 states to 9145 states and 22956 transitions. [2019-12-27 15:54:54,148 INFO L78 Accepts]: Start accepts. Automaton has 9145 states and 22956 transitions. Word has length 47 [2019-12-27 15:54:54,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:54,148 INFO L462 AbstractCegarLoop]: Abstraction has 9145 states and 22956 transitions. [2019-12-27 15:54:54,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:54:54,148 INFO L276 IsEmpty]: Start isEmpty. Operand 9145 states and 22956 transitions. [2019-12-27 15:54:54,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 15:54:54,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:54,160 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] [2019-12-27 15:54:54,160 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:54,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:54,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1124747, now seen corresponding path program 3 times [2019-12-27 15:54:54,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:54,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647895723] [2019-12-27 15:54:54,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:54,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:54:54,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647895723] [2019-12-27 15:54:54,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:54,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:54:54,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [669394743] [2019-12-27 15:54:54,275 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:54,286 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:54,315 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 61 transitions. [2019-12-27 15:54:54,315 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:54,315 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:54:54,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:54:54,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:54,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:54:54,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:54:54,316 INFO L87 Difference]: Start difference. First operand 9145 states and 22956 transitions. Second operand 6 states. [2019-12-27 15:54:54,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:54,389 INFO L93 Difference]: Finished difference Result 7666 states and 19712 transitions. [2019-12-27 15:54:54,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:54:54,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-27 15:54:54,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:54,390 INFO L225 Difference]: With dead ends: 7666 [2019-12-27 15:54:54,390 INFO L226 Difference]: Without dead ends: 432 [2019-12-27 15:54:54,390 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-27 15:54:54,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-27 15:54:54,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2019-12-27 15:54:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-12-27 15:54:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 926 transitions. [2019-12-27 15:54:54,396 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 926 transitions. Word has length 47 [2019-12-27 15:54:54,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:54,396 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 926 transitions. [2019-12-27 15:54:54,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:54:54,396 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 926 transitions. [2019-12-27 15:54:54,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 15:54:54,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:54,397 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] [2019-12-27 15:54:54,397 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:54,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:54,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2126696180, now seen corresponding path program 1 times [2019-12-27 15:54:54,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:54,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539580908] [2019-12-27 15:54:54,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:54:54,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539580908] [2019-12-27 15:54:54,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:54,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:54:54,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1288702208] [2019-12-27 15:54:54,490 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:54,509 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:54,674 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 273 transitions. [2019-12-27 15:54:54,675 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:54,826 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 15:54:54,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:54:54,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:54,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:54:54,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:54:54,827 INFO L87 Difference]: Start difference. First operand 432 states and 926 transitions. Second operand 10 states. [2019-12-27 15:54:55,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:55,923 INFO L93 Difference]: Finished difference Result 3263 states and 6999 transitions. [2019-12-27 15:54:55,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 15:54:55,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2019-12-27 15:54:55,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:55,927 INFO L225 Difference]: With dead ends: 3263 [2019-12-27 15:54:55,927 INFO L226 Difference]: Without dead ends: 2001 [2019-12-27 15:54:55,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=340, Invalid=1466, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 15:54:55,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2019-12-27 15:54:55,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 799. [2019-12-27 15:54:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-12-27 15:54:55,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1754 transitions. [2019-12-27 15:54:55,940 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1754 transitions. Word has length 63 [2019-12-27 15:54:55,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:55,941 INFO L462 AbstractCegarLoop]: Abstraction has 799 states and 1754 transitions. [2019-12-27 15:54:55,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:54:55,941 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1754 transitions. [2019-12-27 15:54:55,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 15:54:55,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:55,942 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] [2019-12-27 15:54:55,942 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:55,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:55,942 INFO L82 PathProgramCache]: Analyzing trace with hash 222753420, now seen corresponding path program 2 times [2019-12-27 15:54:55,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:55,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527982133] [2019-12-27 15:54:55,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:54:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:54:56,053 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:54:56,053 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:54:56,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] ULTIMATE.startENTRY-->L838: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_40) (= 0 v_~z$flush_delayed~0_312) (= v_~z$r_buff0_thd1~0_133 0) (= |v_#NULL.offset_6| 0) (= 0 |v_ULTIMATE.start_main_~#t302~0.offset_23|) (= 0 v_~z$r_buff1_thd3~0_369) (= v_~__unbuffered_p2_EBX~0_30 0) (= v_~x~0_59 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t302~0.base_31| 4)) (= v_~z$read_delayed~0_6 0) (= v_~main$tmp_guard1~0_30 0) (= v_~z$w_buff0~0_407 0) (= v_~z$r_buff1_thd0~0_262 0) (= v_~z$r_buff1_thd1~0_201 0) (= 0 v_~__unbuffered_p1_EAX~0_53) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$mem_tmp~0_246) (= v_~z$r_buff1_thd2~0_361 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t302~0.base_31|) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$w_buff0_used~0_953 0) (= v_~z$r_buff0_thd0~0_190 0) (= v_~a~0_20 0) (= v_~weak$$choice2~0_312 0) (= 0 |v_#NULL.base_6|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t302~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t302~0.base_31|) |v_ULTIMATE.start_main_~#t302~0.offset_23| 0)) |v_#memory_int_23|) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~z$r_buff0_thd3~0_586) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$w_buff1~0_282 0) (= v_~z$w_buff1_used~0_540 0) (= v_~z$r_buff0_thd2~0_401 0) (= 0 v_~weak$$choice0~0_233) (= v_~main$tmp_guard0~0_32 0) (= v_~__unbuffered_cnt~0_150 0) (= |v_#valid_67| (store .cse0 |v_ULTIMATE.start_main_~#t302~0.base_31| 1)) (= v_~y~0_37 0) (= v_~z~0_322 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t302~0.base_31|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_361, #NULL.offset=|v_#NULL.offset_6|, ~a~0=v_~a~0_20, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_190, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ULTIMATE.start_main_~#t304~0.base=|v_ULTIMATE.start_main_~#t304~0.base_22|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~z$mem_tmp~0=v_~z$mem_tmp~0_246, ULTIMATE.start_main_~#t303~0.base=|v_ULTIMATE.start_main_~#t303~0.base_22|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_58|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_540, ~z$flush_delayed~0=v_~z$flush_delayed~0_312, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~weak$$choice0~0=v_~weak$$choice0~0_233, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_40|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_201, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_586, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_150, ~x~0=v_~x~0_59, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ULTIMATE.start_main_~#t302~0.offset=|v_ULTIMATE.start_main_~#t302~0.offset_23|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_282, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t302~0.base=|v_ULTIMATE.start_main_~#t302~0.base_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_262, ~y~0=v_~y~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_401, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_953, ~z$w_buff0~0=v_~z$w_buff0~0_407, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_369, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_73|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ULTIMATE.start_main_~#t304~0.offset=|v_ULTIMATE.start_main_~#t304~0.offset_18|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_446|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t303~0.offset=|v_ULTIMATE.start_main_~#t303~0.offset_18|, ~z~0=v_~z~0_322, ~weak$$choice2~0=v_~weak$$choice2~0_312, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_133} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t304~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t303~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ~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, ~x~0, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t302~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t302~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t304~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t303~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 15:54:56,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [974] [974] L838-1-->L840: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t303~0.base_10|)) (= |v_ULTIMATE.start_main_~#t303~0.offset_9| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t303~0.base_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t303~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t303~0.base_10|) |v_ULTIMATE.start_main_~#t303~0.offset_9| 1)) |v_#memory_int_13|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t303~0.base_10| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t303~0.base_10| 4)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t303~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t303~0.base=|v_ULTIMATE.start_main_~#t303~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t303~0.offset=|v_ULTIMATE.start_main_~#t303~0.offset_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t303~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t303~0.offset, #length] because there is no mapped edge [2019-12-27 15:54:56,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L840-1-->L842: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t304~0.base_11| 4) |v_#length_17|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t304~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t304~0.base_11|) |v_ULTIMATE.start_main_~#t304~0.offset_10| 2))) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t304~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t304~0.offset_10|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t304~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t304~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t304~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t304~0.base=|v_ULTIMATE.start_main_~#t304~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t304~0.offset=|v_ULTIMATE.start_main_~#t304~0.offset_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t304~0.base, #length, ULTIMATE.start_main_~#t304~0.offset] because there is no mapped edge [2019-12-27 15:54:56,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] P2ENTRY-->L4-3: Formula: (and (= (mod v_~z$w_buff1_used~0_82 256) 0) (= v_~z$w_buff0~0_55 v_~z$w_buff1~0_45) (= v_~z$w_buff0_used~0_158 v_~z$w_buff1_used~0_82) (= 1 v_~z$w_buff0~0_54) (= v_~z$w_buff0_used~0_157 1) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_19| v_P2Thread1of1ForFork0_~arg.offset_19) (= |v_P2Thread1of1ForFork0_#in~arg.base_19| v_P2Thread1of1ForFork0_~arg.base_19) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_21 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_158, ~z$w_buff0~0=v_~z$w_buff0~0_55, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_19, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_157, ~z$w_buff0~0=v_~z$w_buff0~0_54, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$w_buff1~0=v_~z$w_buff1~0_45, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_21} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 15:54:56,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L800-2-->L800-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite28_Out1108977359| |P2Thread1of1ForFork0_#t~ite29_Out1108977359|)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1108977359 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1108977359 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite28_Out1108977359| ~z$w_buff0~0_In1108977359) (not .cse1) (not .cse2)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite28_Out1108977359| ~z$w_buff1~0_In1108977359) (or .cse2 .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1108977359, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1108977359, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1108977359, ~z$w_buff1~0=~z$w_buff1~0_In1108977359} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1108977359|, ~z$w_buff0~0=~z$w_buff0~0_In1108977359, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1108977359, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1108977359, ~z$w_buff1~0=~z$w_buff1~0_In1108977359, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1108977359|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 15:54:56,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L805-->L806: Formula: (and (= v_~z$r_buff0_thd3~0_95 v_~z$r_buff0_thd3~0_94) (not (= (mod v_~weak$$choice2~0_47 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_47} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_11|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_94, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_8|, ~weak$$choice2~0=v_~weak$$choice2~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 15:54:56,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-534269447 256) 0))) (or (and .cse0 (= ~z~0_In-534269447 |P2Thread1of1ForFork0_#t~ite48_Out-534269447|)) (and (= ~z$mem_tmp~0_In-534269447 |P2Thread1of1ForFork0_#t~ite48_Out-534269447|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-534269447, ~z$flush_delayed~0=~z$flush_delayed~0_In-534269447, ~z~0=~z~0_In-534269447} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-534269447|, ~z$mem_tmp~0=~z$mem_tmp~0_In-534269447, ~z$flush_delayed~0=~z$flush_delayed~0_In-534269447, ~z~0=~z~0_In-534269447} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-27 15:54:56,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_36 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.base_9 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89) (= v_~a~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_9|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|} OutVars{~a~0=v_~a~0_13, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 15:54:56,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1317453478 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1317453478 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1317453478|)) (and (= ~z$w_buff0_used~0_In1317453478 |P2Thread1of1ForFork0_#t~ite51_Out1317453478|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1317453478, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1317453478} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1317453478, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1317453478, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1317453478|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-27 15:54:56,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L817-->L817-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1922654475 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1922654475 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1922654475 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1922654475 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite52_Out1922654475| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite52_Out1922654475| ~z$w_buff1_used~0_In1922654475) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1922654475, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1922654475, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1922654475, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1922654475} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1922654475, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1922654475, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1922654475, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1922654475|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1922654475} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-27 15:54:56,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L818-->L819: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In521839632 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In521839632 256) 0))) (or (and (= ~z$r_buff0_thd3~0_Out521839632 ~z$r_buff0_thd3~0_In521839632) (or .cse0 .cse1)) (and (= ~z$r_buff0_thd3~0_Out521839632 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In521839632, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In521839632} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In521839632, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out521839632, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out521839632|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-27 15:54:56,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1657138811 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1657138811 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1657138811 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-1657138811 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite54_Out-1657138811| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork0_#t~ite54_Out-1657138811| ~z$r_buff1_thd3~0_In-1657138811) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1657138811, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1657138811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1657138811, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1657138811} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1657138811, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-1657138811|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1657138811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1657138811, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1657138811} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 15:54:56,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L819-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_121 (+ v_~__unbuffered_cnt~0_122 1)) (= v_~z$r_buff1_thd3~0_301 |v_P2Thread1of1ForFork0_#t~ite54_32|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_122} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_31|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 15:54:56,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1335841256 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out-1335841256| ~z$mem_tmp~0_In-1335841256) (not .cse0)) (and (= ~z~0_In-1335841256 |P1Thread1of1ForFork2_#t~ite25_Out-1335841256|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1335841256, ~z$flush_delayed~0=~z$flush_delayed~0_In-1335841256, ~z~0=~z~0_In-1335841256} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1335841256, ~z$flush_delayed~0=~z$flush_delayed~0_In-1335841256, ~z~0=~z~0_In-1335841256, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1335841256|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 15:54:56,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L771-2-->P1EXIT: Formula: (and (= v_~z~0_145 |v_P1Thread1of1ForFork2_#t~ite25_58|) (= 0 v_~z$flush_delayed~0_126) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_58|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~z$flush_delayed~0=v_~z$flush_delayed~0_126, ~z~0=v_~z~0_145, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_57|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 15:54:56,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] L846-->L848-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_18 256)) (= 0 (mod v_~z$w_buff0_used~0_136 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 15:54:56,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L848-2-->L848-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-705677156 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-705677156 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite58_Out-705677156| |ULTIMATE.start_main_#t~ite59_Out-705677156|))) (or (and (= |ULTIMATE.start_main_#t~ite58_Out-705677156| ~z~0_In-705677156) (or .cse0 .cse1) .cse2) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite58_Out-705677156| ~z$w_buff1~0_In-705677156) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-705677156, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-705677156, ~z$w_buff1~0=~z$w_buff1~0_In-705677156, ~z~0=~z~0_In-705677156} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-705677156, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-705677156|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-705677156, ~z$w_buff1~0=~z$w_buff1~0_In-705677156, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-705677156|, ~z~0=~z~0_In-705677156} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 15:54:56,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L849-->L849-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1983907404 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1983907404 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out1983907404| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite60_Out1983907404| ~z$w_buff0_used~0_In1983907404) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1983907404, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1983907404} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1983907404|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1983907404, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1983907404} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 15:54:56,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L850-->L850-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In754198007 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In754198007 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In754198007 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In754198007 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out754198007| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In754198007 |ULTIMATE.start_main_#t~ite61_Out754198007|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In754198007, ~z$w_buff0_used~0=~z$w_buff0_used~0_In754198007, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In754198007, ~z$w_buff1_used~0=~z$w_buff1_used~0_In754198007} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In754198007, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out754198007|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In754198007, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In754198007, ~z$w_buff1_used~0=~z$w_buff1_used~0_In754198007} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 15:54:56,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1408426641 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1408426641 256)))) (or (and (= ~z$r_buff0_thd0~0_In1408426641 |ULTIMATE.start_main_#t~ite62_Out1408426641|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out1408426641|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1408426641, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1408426641} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1408426641|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1408426641, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1408426641} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 15:54:56,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L852-->L852-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In566005649 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In566005649 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In566005649 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In566005649 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite63_Out566005649|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd0~0_In566005649 |ULTIMATE.start_main_#t~ite63_Out566005649|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In566005649, ~z$w_buff0_used~0=~z$w_buff0_used~0_In566005649, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In566005649, ~z$w_buff1_used~0=~z$w_buff1_used~0_In566005649} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out566005649|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In566005649, ~z$w_buff0_used~0=~z$w_buff0_used~0_In566005649, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In566005649, ~z$w_buff1_used~0=~z$w_buff1_used~0_In566005649} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 15:54:56,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1022] [1022] L852-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~x~0_50 2) (= v_~__unbuffered_p1_EBX~0_20 0) (= v_~main$tmp_guard1~0_21 0) (= v_~__unbuffered_p2_EBX~0_21 0) (= v_~z$r_buff1_thd0~0_249 |v_ULTIMATE.start_main_#t~ite63_36|) (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= 1 v_~__unbuffered_p1_EAX~0_44) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_36|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~x~0=v_~x~0_50} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_35|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_249, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~x~0=v_~x~0_50, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 15:54:56,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:54:56 BasicIcfg [2019-12-27 15:54:56,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:54:56,208 INFO L168 Benchmark]: Toolchain (without parser) took 89858.33 ms. Allocated memory was 145.8 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 102.2 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 601.2 MB. Max. memory is 7.1 GB. [2019-12-27 15:54:56,208 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 15:54:56,209 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.48 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 155.8 MB in the end (delta: -54.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 15:54:56,210 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.51 ms. Allocated memory is still 202.9 MB. Free memory was 155.8 MB in the beginning and 152.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 15:54:56,212 INFO L168 Benchmark]: Boogie Preprocessor took 42.09 ms. Allocated memory is still 202.9 MB. Free memory was 152.6 MB in the beginning and 149.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 15:54:56,213 INFO L168 Benchmark]: RCFGBuilder took 897.26 ms. Allocated memory is still 202.9 MB. Free memory was 149.9 MB in the beginning and 94.9 MB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 7.1 GB. [2019-12-27 15:54:56,213 INFO L168 Benchmark]: TraceAbstraction took 88017.71 ms. Allocated memory was 202.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 94.2 MB in the beginning and 2.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 536.1 MB. Max. memory is 7.1 GB. [2019-12-27 15:54:56,216 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.22 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 817.48 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 155.8 MB in the end (delta: -54.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.51 ms. Allocated memory is still 202.9 MB. Free memory was 155.8 MB in the beginning and 152.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.09 ms. Allocated memory is still 202.9 MB. Free memory was 152.6 MB in the beginning and 149.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 897.26 ms. Allocated memory is still 202.9 MB. Free memory was 149.9 MB in the beginning and 94.9 MB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88017.71 ms. Allocated memory was 202.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 94.2 MB in the beginning and 2.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 536.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.7s, 196 ProgramPointsBefore, 103 ProgramPointsAfterwards, 242 TransitionsBefore, 122 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 31 ChoiceCompositions, 9041 VarBasedMoverChecksPositive, 312 VarBasedMoverChecksNegative, 82 SemBasedMoverChecksPositive, 320 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 0 MoverChecksTotal, 115591 CheckedPairsTotal, 128 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L838] FCALL, FORK 0 pthread_create(&t302, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L840] FCALL, FORK 0 pthread_create(&t303, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L842] FCALL, FORK 0 pthread_create(&t304, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L789] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L790] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L791] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L792] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L793] 3 z$r_buff0_thd3 = (_Bool)1 [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 z$flush_delayed = weak$$choice2 [L799] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L800] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L800] 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) [L801] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L801] 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)) [L802] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L802] 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)) [L803] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L803] 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)) [L804] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L804] 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)) [L806] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L806] 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)) [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L808] 3 z = z$flush_delayed ? z$mem_tmp : z [L809] 3 z$flush_delayed = (_Bool)0 [L812] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L750] 2 x = 2 [L753] 2 y = 1 [L756] 2 __unbuffered_p1_EAX = y [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 z$flush_delayed = weak$$choice2 [L762] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L763] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L763] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L764] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L764] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L765] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L765] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L766] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L766] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L767] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L768] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L768] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L769] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L769] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L848] 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) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 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 [L851] 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 4 procedures, 187 locations, 2 error locations. Result: UNSAFE, OverallTime: 87.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 32.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3309 SDtfs, 7233 SDslu, 8103 SDs, 0 SdLazy, 4272 SolverSat, 604 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 36 SyntacticMatches, 8 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1294 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124844occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 38.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 479239 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 534 NumberOfCodeBlocks, 534 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 48832 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...