/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix039_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:08:13,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:08:13,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:08:13,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:08:13,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:08:13,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:08:13,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:08:13,122 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:08:13,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:08:13,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:08:13,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:08:13,126 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:08:13,126 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:08:13,127 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:08:13,128 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:08:13,129 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:08:13,130 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:08:13,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:08:13,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:08:13,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:08:13,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:08:13,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:08:13,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:08:13,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:08:13,142 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:08:13,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:08:13,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:08:13,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:08:13,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:08:13,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:08:13,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:08:13,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:08:13,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:08:13,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:08:13,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:08:13,149 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:08:13,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:08:13,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:08:13,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:08:13,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:08:13,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:08:13,152 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:08:13,173 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:08:13,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:08:13,175 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:08:13,175 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:08:13,175 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:08:13,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:08:13,176 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:08:13,176 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:08:13,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:08:13,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:08:13,177 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:08:13,177 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:08:13,177 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:08:13,177 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:08:13,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:08:13,178 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:08:13,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:08:13,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:08:13,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:08:13,178 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:08:13,180 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:08:13,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:08:13,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:08:13,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:08:13,181 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:08:13,181 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:08:13,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:08:13,182 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:08:13,182 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:08:13,182 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:08:13,183 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:08:13,183 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:08:13,449 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:08:13,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:08:13,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:08:13,474 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:08:13,475 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:08:13,476 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039_rmo.opt.i [2019-12-27 21:08:13,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0afc5ea6e/e0ec9656dbaa44e9a9c334a87d902e4a/FLAG9969791a7 [2019-12-27 21:08:14,097 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:08:14,098 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039_rmo.opt.i [2019-12-27 21:08:14,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0afc5ea6e/e0ec9656dbaa44e9a9c334a87d902e4a/FLAG9969791a7 [2019-12-27 21:08:14,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0afc5ea6e/e0ec9656dbaa44e9a9c334a87d902e4a [2019-12-27 21:08:14,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:08:14,399 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:08:14,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:08:14,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:08:14,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:08:14,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:08:14" (1/1) ... [2019-12-27 21:08:14,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17a48cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:14, skipping insertion in model container [2019-12-27 21:08:14,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:08:14" (1/1) ... [2019-12-27 21:08:14,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:08:14,491 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:08:15,033 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:08:15,053 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:08:15,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:08:15,195 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:08:15,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:15 WrapperNode [2019-12-27 21:08:15,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:08:15,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:08:15,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:08:15,197 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:08:15,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:15" (1/1) ... [2019-12-27 21:08:15,226 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:15" (1/1) ... [2019-12-27 21:08:15,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:08:15,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:08:15,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:08:15,257 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:08:15,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:15" (1/1) ... [2019-12-27 21:08:15,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:15" (1/1) ... [2019-12-27 21:08:15,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:15" (1/1) ... [2019-12-27 21:08:15,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:15" (1/1) ... [2019-12-27 21:08:15,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:15" (1/1) ... [2019-12-27 21:08:15,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:15" (1/1) ... [2019-12-27 21:08:15,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:15" (1/1) ... [2019-12-27 21:08:15,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:08:15,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:08:15,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:08:15,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:08:15,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:15" (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 21:08:15,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:08:15,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:08:15,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:08:15,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:08:15,359 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:08:15,360 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:08:15,360 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:08:15,360 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:08:15,360 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:08:15,360 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:08:15,361 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 21:08:15,361 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 21:08:15,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:08:15,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:08:15,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:08:15,363 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 21:08:16,112 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:08:16,112 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:08:16,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:08:16 BoogieIcfgContainer [2019-12-27 21:08:16,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:08:16,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:08:16,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:08:16,119 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:08:16,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:08:14" (1/3) ... [2019-12-27 21:08:16,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6324e071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:08:16, skipping insertion in model container [2019-12-27 21:08:16,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:08:15" (2/3) ... [2019-12-27 21:08:16,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6324e071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:08:16, skipping insertion in model container [2019-12-27 21:08:16,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:08:16" (3/3) ... [2019-12-27 21:08:16,123 INFO L109 eAbstractionObserver]: Analyzing ICFG mix039_rmo.opt.i [2019-12-27 21:08:16,135 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:08:16,135 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:08:16,148 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:08:16,149 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:08:16,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,212 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,213 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,215 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,216 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,220 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,220 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,267 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,268 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,268 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,268 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,268 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,269 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,269 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,269 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,269 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,270 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,298 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,298 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,299 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,299 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,299 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,299 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,299 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,299 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,301 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,301 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,301 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,301 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,307 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,307 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,312 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,313 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,321 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,322 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,322 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,322 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,322 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,322 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,322 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,323 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,323 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,323 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,323 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,323 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,326 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,327 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:08:16,342 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 21:08:16,365 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:08:16,366 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:08:16,366 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:08:16,366 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:08:16,366 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:08:16,366 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:08:16,366 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:08:16,366 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:08:16,382 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-27 21:08:16,384 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 21:08:16,480 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 21:08:16,480 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:08:16,495 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 21:08:16,517 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 21:08:16,566 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 21:08:16,566 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:08:16,573 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 21:08:16,589 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 21:08:16,590 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:08:19,985 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-12-27 21:08:20,582 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 21:08:20,751 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 21:08:20,765 INFO L206 etLargeBlockEncoding]: Checked pairs total: 45931 [2019-12-27 21:08:20,765 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-27 21:08:20,768 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 79 transitions [2019-12-27 21:08:22,057 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22190 states. [2019-12-27 21:08:22,059 INFO L276 IsEmpty]: Start isEmpty. Operand 22190 states. [2019-12-27 21:08:22,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 21:08:22,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:22,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:08:22,068 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:22,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:22,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1275249875, now seen corresponding path program 1 times [2019-12-27 21:08:22,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:22,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317513134] [2019-12-27 21:08:22,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:22,361 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 21:08:22,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317513134] [2019-12-27 21:08:22,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:22,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:08:22,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1365103116] [2019-12-27 21:08:22,364 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:22,369 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:22,385 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 21:08:22,386 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:22,390 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:08:22,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:08:22,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:22,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:08:22,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:08:22,408 INFO L87 Difference]: Start difference. First operand 22190 states. Second operand 3 states. [2019-12-27 21:08:22,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:22,902 INFO L93 Difference]: Finished difference Result 21750 states and 93576 transitions. [2019-12-27 21:08:22,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:08:22,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 21:08:22,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:23,139 INFO L225 Difference]: With dead ends: 21750 [2019-12-27 21:08:23,140 INFO L226 Difference]: Without dead ends: 20406 [2019-12-27 21:08:23,144 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 21:08:24,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20406 states. [2019-12-27 21:08:24,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20406 to 20406. [2019-12-27 21:08:24,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20406 states. [2019-12-27 21:08:25,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20406 states to 20406 states and 87656 transitions. [2019-12-27 21:08:25,132 INFO L78 Accepts]: Start accepts. Automaton has 20406 states and 87656 transitions. Word has length 9 [2019-12-27 21:08:25,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:25,134 INFO L462 AbstractCegarLoop]: Abstraction has 20406 states and 87656 transitions. [2019-12-27 21:08:25,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:08:25,134 INFO L276 IsEmpty]: Start isEmpty. Operand 20406 states and 87656 transitions. [2019-12-27 21:08:25,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:08:25,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:25,141 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:08:25,141 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:25,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:25,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1986305756, now seen corresponding path program 1 times [2019-12-27 21:08:25,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:25,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650568674] [2019-12-27 21:08:25,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:25,308 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 21:08:25,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650568674] [2019-12-27 21:08:25,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:25,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:08:25,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2067836189] [2019-12-27 21:08:25,310 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:25,312 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:25,318 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 21:08:25,319 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:25,319 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:08:25,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:08:25,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:25,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:08:25,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:08:25,322 INFO L87 Difference]: Start difference. First operand 20406 states and 87656 transitions. Second operand 4 states. [2019-12-27 21:08:25,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:25,816 INFO L93 Difference]: Finished difference Result 31694 states and 131120 transitions. [2019-12-27 21:08:25,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:08:25,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 21:08:25,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:27,195 INFO L225 Difference]: With dead ends: 31694 [2019-12-27 21:08:27,196 INFO L226 Difference]: Without dead ends: 31634 [2019-12-27 21:08:27,197 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 21:08:27,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31634 states. [2019-12-27 21:08:28,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31634 to 28582. [2019-12-27 21:08:28,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28582 states. [2019-12-27 21:08:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28582 states to 28582 states and 119644 transitions. [2019-12-27 21:08:28,293 INFO L78 Accepts]: Start accepts. Automaton has 28582 states and 119644 transitions. Word has length 15 [2019-12-27 21:08:28,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:28,293 INFO L462 AbstractCegarLoop]: Abstraction has 28582 states and 119644 transitions. [2019-12-27 21:08:28,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:08:28,293 INFO L276 IsEmpty]: Start isEmpty. Operand 28582 states and 119644 transitions. [2019-12-27 21:08:28,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 21:08:28,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:28,301 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 21:08:28,301 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:28,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:28,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2051676058, now seen corresponding path program 1 times [2019-12-27 21:08:28,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:28,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988050931] [2019-12-27 21:08:28,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:28,393 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 21:08:28,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988050931] [2019-12-27 21:08:28,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:28,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:08:28,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1161163809] [2019-12-27 21:08:28,395 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:28,400 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:28,405 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 21:08:28,406 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:28,446 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:08:28,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:08:28,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:28,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:08:28,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:08:28,448 INFO L87 Difference]: Start difference. First operand 28582 states and 119644 transitions. Second operand 5 states. [2019-12-27 21:08:29,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:29,119 INFO L93 Difference]: Finished difference Result 35982 states and 149300 transitions. [2019-12-27 21:08:29,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:08:29,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 21:08:29,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:29,296 INFO L225 Difference]: With dead ends: 35982 [2019-12-27 21:08:29,297 INFO L226 Difference]: Without dead ends: 35934 [2019-12-27 21:08:29,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 21:08:29,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35934 states. [2019-12-27 21:08:30,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35934 to 31130. [2019-12-27 21:08:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31130 states. [2019-12-27 21:08:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31130 states to 31130 states and 130164 transitions. [2019-12-27 21:08:30,668 INFO L78 Accepts]: Start accepts. Automaton has 31130 states and 130164 transitions. Word has length 18 [2019-12-27 21:08:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:30,669 INFO L462 AbstractCegarLoop]: Abstraction has 31130 states and 130164 transitions. [2019-12-27 21:08:30,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:08:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 31130 states and 130164 transitions. [2019-12-27 21:08:30,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 21:08:30,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:30,678 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:08:30,679 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:30,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:30,679 INFO L82 PathProgramCache]: Analyzing trace with hash 94366494, now seen corresponding path program 1 times [2019-12-27 21:08:30,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:30,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090766218] [2019-12-27 21:08:30,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:30,742 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 21:08:30,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090766218] [2019-12-27 21:08:30,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:30,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:08:30,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1684827004] [2019-12-27 21:08:30,748 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:30,752 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:30,756 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 22 transitions. [2019-12-27 21:08:30,757 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:30,757 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:08:30,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:08:30,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:30,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:08:30,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:08:30,758 INFO L87 Difference]: Start difference. First operand 31130 states and 130164 transitions. Second operand 3 states. [2019-12-27 21:08:31,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:31,238 INFO L93 Difference]: Finished difference Result 30694 states and 128328 transitions. [2019-12-27 21:08:31,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:08:31,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 21:08:31,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:31,450 INFO L225 Difference]: With dead ends: 30694 [2019-12-27 21:08:31,451 INFO L226 Difference]: Without dead ends: 30694 [2019-12-27 21:08:31,451 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 21:08:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30694 states. [2019-12-27 21:08:32,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30694 to 30694. [2019-12-27 21:08:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30694 states. [2019-12-27 21:08:32,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30694 states to 30694 states and 128328 transitions. [2019-12-27 21:08:32,621 INFO L78 Accepts]: Start accepts. Automaton has 30694 states and 128328 transitions. Word has length 20 [2019-12-27 21:08:32,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:32,621 INFO L462 AbstractCegarLoop]: Abstraction has 30694 states and 128328 transitions. [2019-12-27 21:08:32,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:08:32,621 INFO L276 IsEmpty]: Start isEmpty. Operand 30694 states and 128328 transitions. [2019-12-27 21:08:32,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 21:08:32,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:32,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:08:32,634 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:32,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:32,634 INFO L82 PathProgramCache]: Analyzing trace with hash 831760779, now seen corresponding path program 1 times [2019-12-27 21:08:32,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:32,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974209258] [2019-12-27 21:08:32,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:32,719 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 21:08:32,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974209258] [2019-12-27 21:08:32,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:32,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:08:32,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1658547670] [2019-12-27 21:08:32,720 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:32,724 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:32,729 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 33 transitions. [2019-12-27 21:08:32,729 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:32,729 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:08:32,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:08:32,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:32,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:08:32,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:08:32,730 INFO L87 Difference]: Start difference. First operand 30694 states and 128328 transitions. Second operand 3 states. [2019-12-27 21:08:32,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:32,918 INFO L93 Difference]: Finished difference Result 30650 states and 128132 transitions. [2019-12-27 21:08:32,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:08:32,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 21:08:32,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:33,016 INFO L225 Difference]: With dead ends: 30650 [2019-12-27 21:08:33,017 INFO L226 Difference]: Without dead ends: 30650 [2019-12-27 21:08:33,017 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 21:08:34,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30650 states. [2019-12-27 21:08:35,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30650 to 30650. [2019-12-27 21:08:35,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30650 states. [2019-12-27 21:08:35,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30650 states to 30650 states and 128132 transitions. [2019-12-27 21:08:35,395 INFO L78 Accepts]: Start accepts. Automaton has 30650 states and 128132 transitions. Word has length 21 [2019-12-27 21:08:35,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:35,396 INFO L462 AbstractCegarLoop]: Abstraction has 30650 states and 128132 transitions. [2019-12-27 21:08:35,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:08:35,396 INFO L276 IsEmpty]: Start isEmpty. Operand 30650 states and 128132 transitions. [2019-12-27 21:08:35,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:08:35,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:35,410 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:08:35,410 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:35,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:35,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1462742231, now seen corresponding path program 1 times [2019-12-27 21:08:35,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:35,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693454455] [2019-12-27 21:08:35,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:35,465 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 21:08:35,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693454455] [2019-12-27 21:08:35,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:35,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:08:35,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [925940847] [2019-12-27 21:08:35,466 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:35,469 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:35,475 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 46 transitions. [2019-12-27 21:08:35,475 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:35,475 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:08:35,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:08:35,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:35,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:08:35,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:08:35,476 INFO L87 Difference]: Start difference. First operand 30650 states and 128132 transitions. Second operand 3 states. [2019-12-27 21:08:35,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:35,954 INFO L93 Difference]: Finished difference Result 45416 states and 181621 transitions. [2019-12-27 21:08:35,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:08:35,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-27 21:08:35,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:36,053 INFO L225 Difference]: With dead ends: 45416 [2019-12-27 21:08:36,053 INFO L226 Difference]: Without dead ends: 32472 [2019-12-27 21:08:36,054 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 21:08:36,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32472 states. [2019-12-27 21:08:38,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32472 to 31184. [2019-12-27 21:08:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31184 states. [2019-12-27 21:08:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31184 states to 31184 states and 116749 transitions. [2019-12-27 21:08:38,338 INFO L78 Accepts]: Start accepts. Automaton has 31184 states and 116749 transitions. Word has length 22 [2019-12-27 21:08:38,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:38,338 INFO L462 AbstractCegarLoop]: Abstraction has 31184 states and 116749 transitions. [2019-12-27 21:08:38,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:08:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 31184 states and 116749 transitions. [2019-12-27 21:08:38,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:08:38,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:38,352 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 21:08:38,352 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:38,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:38,352 INFO L82 PathProgramCache]: Analyzing trace with hash 469546711, now seen corresponding path program 1 times [2019-12-27 21:08:38,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:38,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877919062] [2019-12-27 21:08:38,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:38,428 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 21:08:38,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877919062] [2019-12-27 21:08:38,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:38,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:08:38,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [711442595] [2019-12-27 21:08:38,429 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:38,432 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:38,438 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 55 transitions. [2019-12-27 21:08:38,439 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:38,447 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:08:38,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:08:38,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:38,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:08:38,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:08:38,448 INFO L87 Difference]: Start difference. First operand 31184 states and 116749 transitions. Second operand 4 states. [2019-12-27 21:08:38,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:38,632 INFO L93 Difference]: Finished difference Result 31184 states and 115357 transitions. [2019-12-27 21:08:38,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:08:38,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-27 21:08:38,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:38,701 INFO L225 Difference]: With dead ends: 31184 [2019-12-27 21:08:38,701 INFO L226 Difference]: Without dead ends: 31184 [2019-12-27 21:08:38,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 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 21:08:38,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31184 states. [2019-12-27 21:08:39,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31184 to 30784. [2019-12-27 21:08:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30784 states. [2019-12-27 21:08:39,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30784 states to 30784 states and 113997 transitions. [2019-12-27 21:08:39,545 INFO L78 Accepts]: Start accepts. Automaton has 30784 states and 113997 transitions. Word has length 22 [2019-12-27 21:08:39,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:39,546 INFO L462 AbstractCegarLoop]: Abstraction has 30784 states and 113997 transitions. [2019-12-27 21:08:39,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:08:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 30784 states and 113997 transitions. [2019-12-27 21:08:39,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 21:08:39,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:39,558 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] [2019-12-27 21:08:39,558 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:39,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:39,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1201021632, now seen corresponding path program 1 times [2019-12-27 21:08:39,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:39,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008761832] [2019-12-27 21:08:39,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:39,636 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 21:08:39,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008761832] [2019-12-27 21:08:39,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:39,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:08:39,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1160888195] [2019-12-27 21:08:39,637 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:39,640 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:39,647 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 52 transitions. [2019-12-27 21:08:39,647 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:39,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:08:39,696 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:08:39,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:08:39,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:39,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:08:39,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:08:39,697 INFO L87 Difference]: Start difference. First operand 30784 states and 113997 transitions. Second operand 7 states. [2019-12-27 21:08:40,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:40,213 INFO L93 Difference]: Finished difference Result 42057 states and 147642 transitions. [2019-12-27 21:08:40,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:08:40,218 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 21:08:40,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:40,307 INFO L225 Difference]: With dead ends: 42057 [2019-12-27 21:08:40,307 INFO L226 Difference]: Without dead ends: 40219 [2019-12-27 21:08:40,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:08:40,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40219 states. [2019-12-27 21:08:41,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40219 to 24465. [2019-12-27 21:08:41,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24465 states. [2019-12-27 21:08:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24465 states to 24465 states and 85880 transitions. [2019-12-27 21:08:41,265 INFO L78 Accepts]: Start accepts. Automaton has 24465 states and 85880 transitions. Word has length 23 [2019-12-27 21:08:41,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:41,265 INFO L462 AbstractCegarLoop]: Abstraction has 24465 states and 85880 transitions. [2019-12-27 21:08:41,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:08:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 24465 states and 85880 transitions. [2019-12-27 21:08:41,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 21:08:41,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:41,276 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:08:41,276 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:41,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:41,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1983808268, now seen corresponding path program 1 times [2019-12-27 21:08:41,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:41,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176241426] [2019-12-27 21:08:41,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:41,360 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 21:08:41,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176241426] [2019-12-27 21:08:41,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:41,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:08:41,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1788047562] [2019-12-27 21:08:41,361 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:41,364 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:41,374 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 74 transitions. [2019-12-27 21:08:41,374 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:41,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:08:41,427 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:08:41,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:08:41,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:41,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:08:41,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:08:41,428 INFO L87 Difference]: Start difference. First operand 24465 states and 85880 transitions. Second operand 8 states. [2019-12-27 21:08:41,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:41,787 INFO L93 Difference]: Finished difference Result 18339 states and 57126 transitions. [2019-12-27 21:08:41,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:08:41,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-27 21:08:41,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:41,815 INFO L225 Difference]: With dead ends: 18339 [2019-12-27 21:08:41,815 INFO L226 Difference]: Without dead ends: 16888 [2019-12-27 21:08:41,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:08:41,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16888 states. [2019-12-27 21:08:41,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16888 to 10902. [2019-12-27 21:08:41,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10902 states. [2019-12-27 21:08:42,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10902 states to 10902 states and 33618 transitions. [2019-12-27 21:08:42,019 INFO L78 Accepts]: Start accepts. Automaton has 10902 states and 33618 transitions. Word has length 24 [2019-12-27 21:08:42,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:42,019 INFO L462 AbstractCegarLoop]: Abstraction has 10902 states and 33618 transitions. [2019-12-27 21:08:42,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:08:42,019 INFO L276 IsEmpty]: Start isEmpty. Operand 10902 states and 33618 transitions. [2019-12-27 21:08:42,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:08:42,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:42,025 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:08:42,025 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:42,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:42,025 INFO L82 PathProgramCache]: Analyzing trace with hash 22545008, now seen corresponding path program 1 times [2019-12-27 21:08:42,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:42,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170627703] [2019-12-27 21:08:42,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:42,076 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 21:08:42,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170627703] [2019-12-27 21:08:42,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:42,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:08:42,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1514432562] [2019-12-27 21:08:42,077 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:42,081 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:42,093 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 92 transitions. [2019-12-27 21:08:42,093 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:42,121 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:08:42,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:08:42,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:42,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:08:42,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:08:42,122 INFO L87 Difference]: Start difference. First operand 10902 states and 33618 transitions. Second operand 5 states. [2019-12-27 21:08:42,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:42,214 INFO L93 Difference]: Finished difference Result 16450 states and 50656 transitions. [2019-12-27 21:08:42,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:08:42,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 21:08:42,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:42,228 INFO L225 Difference]: With dead ends: 16450 [2019-12-27 21:08:42,228 INFO L226 Difference]: Without dead ends: 8773 [2019-12-27 21:08:42,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 21:08:42,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8773 states. [2019-12-27 21:08:42,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8773 to 8484. [2019-12-27 21:08:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8484 states. [2019-12-27 21:08:42,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8484 states to 8484 states and 26171 transitions. [2019-12-27 21:08:42,357 INFO L78 Accepts]: Start accepts. Automaton has 8484 states and 26171 transitions. Word has length 25 [2019-12-27 21:08:42,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:42,357 INFO L462 AbstractCegarLoop]: Abstraction has 8484 states and 26171 transitions. [2019-12-27 21:08:42,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:08:42,357 INFO L276 IsEmpty]: Start isEmpty. Operand 8484 states and 26171 transitions. [2019-12-27 21:08:42,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:08:42,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:42,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:08:42,361 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:42,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:42,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1039706542, now seen corresponding path program 2 times [2019-12-27 21:08:42,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:42,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082329786] [2019-12-27 21:08:42,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:42,413 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 21:08:42,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082329786] [2019-12-27 21:08:42,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:42,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:08:42,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1257808764] [2019-12-27 21:08:42,414 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:42,418 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:42,428 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 62 transitions. [2019-12-27 21:08:42,428 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:42,430 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:08:42,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:08:42,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:42,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:08:42,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:08:42,431 INFO L87 Difference]: Start difference. First operand 8484 states and 26171 transitions. Second operand 4 states. [2019-12-27 21:08:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:42,864 INFO L93 Difference]: Finished difference Result 12593 states and 38979 transitions. [2019-12-27 21:08:42,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:08:42,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 21:08:42,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:42,882 INFO L225 Difference]: With dead ends: 12593 [2019-12-27 21:08:42,882 INFO L226 Difference]: Without dead ends: 7913 [2019-12-27 21:08:42,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 21:08:42,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7913 states. [2019-12-27 21:08:43,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7913 to 7425. [2019-12-27 21:08:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7425 states. [2019-12-27 21:08:43,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7425 states to 7425 states and 21851 transitions. [2019-12-27 21:08:43,064 INFO L78 Accepts]: Start accepts. Automaton has 7425 states and 21851 transitions. Word has length 25 [2019-12-27 21:08:43,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:43,064 INFO L462 AbstractCegarLoop]: Abstraction has 7425 states and 21851 transitions. [2019-12-27 21:08:43,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:08:43,065 INFO L276 IsEmpty]: Start isEmpty. Operand 7425 states and 21851 transitions. [2019-12-27 21:08:43,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:08:43,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:43,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:08:43,071 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:43,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:43,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1222398540, now seen corresponding path program 3 times [2019-12-27 21:08:43,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:43,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083806990] [2019-12-27 21:08:43,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:43,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 21:08:43,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083806990] [2019-12-27 21:08:43,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:43,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:08:43,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [726233003] [2019-12-27 21:08:43,193 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:43,197 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:43,205 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 42 transitions. [2019-12-27 21:08:43,206 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:43,210 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:08:43,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:08:43,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:43,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:08:43,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:08:43,211 INFO L87 Difference]: Start difference. First operand 7425 states and 21851 transitions. Second operand 6 states. [2019-12-27 21:08:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:43,301 INFO L93 Difference]: Finished difference Result 2984 states and 7748 transitions. [2019-12-27 21:08:43,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:08:43,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 21:08:43,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:43,307 INFO L225 Difference]: With dead ends: 2984 [2019-12-27 21:08:43,307 INFO L226 Difference]: Without dead ends: 2530 [2019-12-27 21:08:43,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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 21:08:43,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2019-12-27 21:08:43,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2530. [2019-12-27 21:08:43,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2530 states. [2019-12-27 21:08:43,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2530 states and 6428 transitions. [2019-12-27 21:08:43,346 INFO L78 Accepts]: Start accepts. Automaton has 2530 states and 6428 transitions. Word has length 25 [2019-12-27 21:08:43,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:43,347 INFO L462 AbstractCegarLoop]: Abstraction has 2530 states and 6428 transitions. [2019-12-27 21:08:43,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:08:43,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 6428 transitions. [2019-12-27 21:08:43,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 21:08:43,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:43,352 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] [2019-12-27 21:08:43,353 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:43,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:43,353 INFO L82 PathProgramCache]: Analyzing trace with hash 923857396, now seen corresponding path program 1 times [2019-12-27 21:08:43,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:43,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131035304] [2019-12-27 21:08:43,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:43,418 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 21:08:43,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131035304] [2019-12-27 21:08:43,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:43,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:08:43,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2001767348] [2019-12-27 21:08:43,419 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:43,426 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:43,484 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 155 states and 332 transitions. [2019-12-27 21:08:43,484 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:43,516 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:08:43,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:08:43,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:43,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:08:43,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:08:43,517 INFO L87 Difference]: Start difference. First operand 2530 states and 6428 transitions. Second operand 5 states. [2019-12-27 21:08:43,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:43,603 INFO L93 Difference]: Finished difference Result 3810 states and 9643 transitions. [2019-12-27 21:08:43,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:08:43,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-27 21:08:43,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:43,609 INFO L225 Difference]: With dead ends: 3810 [2019-12-27 21:08:43,609 INFO L226 Difference]: Without dead ends: 3810 [2019-12-27 21:08:43,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:08:43,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3810 states. [2019-12-27 21:08:43,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3810 to 2986. [2019-12-27 21:08:43,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2986 states. [2019-12-27 21:08:43,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 7669 transitions. [2019-12-27 21:08:43,648 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 7669 transitions. Word has length 32 [2019-12-27 21:08:43,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:43,648 INFO L462 AbstractCegarLoop]: Abstraction has 2986 states and 7669 transitions. [2019-12-27 21:08:43,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:08:43,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 7669 transitions. [2019-12-27 21:08:43,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 21:08:43,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:43,652 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] [2019-12-27 21:08:43,652 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:43,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:43,652 INFO L82 PathProgramCache]: Analyzing trace with hash 386347120, now seen corresponding path program 1 times [2019-12-27 21:08:43,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:43,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574712081] [2019-12-27 21:08:43,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:43,726 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 21:08:43,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574712081] [2019-12-27 21:08:43,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:43,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:08:43,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1924426794] [2019-12-27 21:08:43,727 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:43,734 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:43,800 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 155 states and 332 transitions. [2019-12-27 21:08:43,800 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:43,873 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:08:43,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:08:43,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:43,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:08:43,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:08:43,874 INFO L87 Difference]: Start difference. First operand 2986 states and 7669 transitions. Second operand 8 states. [2019-12-27 21:08:44,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:44,408 INFO L93 Difference]: Finished difference Result 5519 states and 13587 transitions. [2019-12-27 21:08:44,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:08:44,408 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 21:08:44,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:44,417 INFO L225 Difference]: With dead ends: 5519 [2019-12-27 21:08:44,417 INFO L226 Difference]: Without dead ends: 5336 [2019-12-27 21:08:44,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:08:44,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5336 states. [2019-12-27 21:08:44,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5336 to 3010. [2019-12-27 21:08:44,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3010 states. [2019-12-27 21:08:44,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 7675 transitions. [2019-12-27 21:08:44,471 INFO L78 Accepts]: Start accepts. Automaton has 3010 states and 7675 transitions. Word has length 32 [2019-12-27 21:08:44,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:44,471 INFO L462 AbstractCegarLoop]: Abstraction has 3010 states and 7675 transitions. [2019-12-27 21:08:44,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:08:44,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states and 7675 transitions. [2019-12-27 21:08:44,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:08:44,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:44,476 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 21:08:44,477 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:44,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:44,477 INFO L82 PathProgramCache]: Analyzing trace with hash 390952001, now seen corresponding path program 1 times [2019-12-27 21:08:44,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:44,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027717111] [2019-12-27 21:08:44,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:44,555 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 21:08:44,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027717111] [2019-12-27 21:08:44,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:44,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:08:44,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [404483055] [2019-12-27 21:08:44,556 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:44,563 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:44,640 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 353 transitions. [2019-12-27 21:08:44,640 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:44,704 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:08:44,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:08:44,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:44,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:08:44,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:08:44,706 INFO L87 Difference]: Start difference. First operand 3010 states and 7675 transitions. Second operand 8 states. [2019-12-27 21:08:45,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:45,247 INFO L93 Difference]: Finished difference Result 5442 states and 13173 transitions. [2019-12-27 21:08:45,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:08:45,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 21:08:45,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:45,255 INFO L225 Difference]: With dead ends: 5442 [2019-12-27 21:08:45,255 INFO L226 Difference]: Without dead ends: 5244 [2019-12-27 21:08:45,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:08:45,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2019-12-27 21:08:45,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 2895. [2019-12-27 21:08:45,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2895 states. [2019-12-27 21:08:45,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 7266 transitions. [2019-12-27 21:08:45,308 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 7266 transitions. Word has length 33 [2019-12-27 21:08:45,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:45,308 INFO L462 AbstractCegarLoop]: Abstraction has 2895 states and 7266 transitions. [2019-12-27 21:08:45,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:08:45,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 7266 transitions. [2019-12-27 21:08:45,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 21:08:45,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:45,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:08:45,312 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:45,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:45,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1721626467, now seen corresponding path program 1 times [2019-12-27 21:08:45,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:45,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059561220] [2019-12-27 21:08:45,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:45,399 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 21:08:45,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059561220] [2019-12-27 21:08:45,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:45,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:08:45,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1320242529] [2019-12-27 21:08:45,400 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:45,409 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:45,426 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 47 states and 57 transitions. [2019-12-27 21:08:45,426 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:45,428 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:08:45,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:08:45,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:45,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:08:45,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:08:45,429 INFO L87 Difference]: Start difference. First operand 2895 states and 7266 transitions. Second operand 7 states. [2019-12-27 21:08:45,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:45,559 INFO L93 Difference]: Finished difference Result 2200 states and 5582 transitions. [2019-12-27 21:08:45,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:08:45,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 21:08:45,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:45,560 INFO L225 Difference]: With dead ends: 2200 [2019-12-27 21:08:45,560 INFO L226 Difference]: Without dead ends: 487 [2019-12-27 21:08:45,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:08:45,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-12-27 21:08:45,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 481. [2019-12-27 21:08:45,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-12-27 21:08:45,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1081 transitions. [2019-12-27 21:08:45,565 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1081 transitions. Word has length 34 [2019-12-27 21:08:45,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:45,565 INFO L462 AbstractCegarLoop]: Abstraction has 481 states and 1081 transitions. [2019-12-27 21:08:45,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:08:45,565 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1081 transitions. [2019-12-27 21:08:45,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 21:08:45,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:45,566 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] [2019-12-27 21:08:45,566 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:45,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:45,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1659981285, now seen corresponding path program 1 times [2019-12-27 21:08:45,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:45,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262890824] [2019-12-27 21:08:45,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:45,649 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 21:08:45,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262890824] [2019-12-27 21:08:45,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:45,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:08:45,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1906266008] [2019-12-27 21:08:45,650 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:45,664 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:45,750 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 158 transitions. [2019-12-27 21:08:45,751 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:45,751 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:08:45,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:08:45,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:45,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:08:45,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:08:45,753 INFO L87 Difference]: Start difference. First operand 481 states and 1081 transitions. Second operand 7 states. [2019-12-27 21:08:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:45,925 INFO L93 Difference]: Finished difference Result 912 states and 2005 transitions. [2019-12-27 21:08:45,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:08:45,925 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-27 21:08:45,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:45,927 INFO L225 Difference]: With dead ends: 912 [2019-12-27 21:08:45,927 INFO L226 Difference]: Without dead ends: 606 [2019-12-27 21:08:45,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:08:45,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-12-27 21:08:45,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 548. [2019-12-27 21:08:45,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-12-27 21:08:45,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1194 transitions. [2019-12-27 21:08:45,935 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1194 transitions. Word has length 48 [2019-12-27 21:08:45,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:45,935 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 1194 transitions. [2019-12-27 21:08:45,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:08:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1194 transitions. [2019-12-27 21:08:45,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 21:08:45,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:45,937 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] [2019-12-27 21:08:45,937 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:45,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:45,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1305532347, now seen corresponding path program 2 times [2019-12-27 21:08:45,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:45,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695814337] [2019-12-27 21:08:45,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:08:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:08:46,056 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:08:46,056 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:08:46,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= v_~b~0_13 0) (= 0 v_~z$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_25) (= v_~z$w_buff0_used~0_92 0) (= 0 v_~z$r_buff1_thd0~0_24) (= 0 v_~z$r_buff1_thd1~0_10) (= 0 v_~__unbuffered_p3_EAX~0_15) (= v_~z$r_buff0_thd1~0_10 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1045~0.base_29| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1045~0.base_29|) |v_ULTIMATE.start_main_~#t1045~0.offset_22| 0)) |v_#memory_int_25|) (= v_~z$r_buff0_thd4~0_27 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~y~0_17 0) (= v_~main$tmp_guard0~0_12 0) (= 0 v_~z$flush_delayed~0_13) (< 0 |v_#StackHeapBarrier_19|) (= 0 v_~__unbuffered_p0_EAX~0_14) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd2~0_9 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 v_~z$w_buff0~0_24) (= 0 |v_ULTIMATE.start_main_~#t1045~0.offset_22|) (= v_~z$read_delayed_var~0.offset_5 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1045~0.base_29|) (= 0 v_~z$w_buff1_used~0_61) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= 0 v_~__unbuffered_p3_EBX~0_15) (= v_~z$mem_tmp~0_10 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1045~0.base_29| 4)) (= v_~z$r_buff0_thd3~0_66 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1045~0.base_29| 1)) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~z$r_buff1_thd3~0_43) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~x~0_12 0) (= v_~z~0_20 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1045~0.base_29|)) (= v_~z$r_buff0_thd0~0_23 0) (= 0 v_~z$r_buff1_thd4~0_19))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1047~0.base=|v_ULTIMATE.start_main_~#t1047~0.base_19|, ULTIMATE.start_main_~#t1046~0.offset=|v_ULTIMATE.start_main_~#t1046~0.offset_18|, ~a~0=v_~a~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_15, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ULTIMATE.start_main_~#t1045~0.offset=|v_ULTIMATE.start_main_~#t1045~0.offset_22|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ULTIMATE.start_main_~#t1045~0.base=|v_ULTIMATE.start_main_~#t1045~0.base_29|, ~x~0=v_~x~0_12, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_~#t1046~0.base=|v_ULTIMATE.start_main_~#t1046~0.base_23|, ULTIMATE.start_main_~#t1047~0.offset=|v_ULTIMATE.start_main_~#t1047~0.offset_16|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_7|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_24, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_15, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ~b~0=v_~b~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t1048~0.base=|v_ULTIMATE.start_main_~#t1048~0.base_19|, ULTIMATE.start_main_~#t1048~0.offset=|v_ULTIMATE.start_main_~#t1048~0.offset_15|, ~z~0=v_~z~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1047~0.base, ULTIMATE.start_main_~#t1046~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1045~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1045~0.base, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1046~0.base, ULTIMATE.start_main_~#t1047~0.offset, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1048~0.base, ULTIMATE.start_main_~#t1048~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:08:46,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L843-1-->L845: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1046~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1046~0.base_11|)) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1046~0.base_11|) 0) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1046~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1046~0.base_11|) |v_ULTIMATE.start_main_~#t1046~0.offset_10| 1))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1046~0.base_11| 4)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1046~0.base_11|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1046~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1046~0.offset=|v_ULTIMATE.start_main_~#t1046~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1046~0.base=|v_ULTIMATE.start_main_~#t1046~0.base_11|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1046~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1046~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 21:08:46,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L845-1-->L847: Formula: (and (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1047~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t1047~0.offset_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1047~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1047~0.base_12|) |v_ULTIMATE.start_main_~#t1047~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1047~0.base_12|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1047~0.base_12|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1047~0.base_12| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1047~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1047~0.base=|v_ULTIMATE.start_main_~#t1047~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1047~0.offset=|v_ULTIMATE.start_main_~#t1047~0.offset_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1047~0.base, ULTIMATE.start_main_~#t1047~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 21:08:46,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-1-->L849: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1048~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1048~0.base_12|) |v_ULTIMATE.start_main_~#t1048~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1048~0.base_12| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1048~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t1048~0.base_12| 0)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1048~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1048~0.offset_10|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1048~0.base_12| 4) |v_#length_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1048~0.base=|v_ULTIMATE.start_main_~#t1048~0.base_12|, ULTIMATE.start_main_~#t1048~0.offset=|v_ULTIMATE.start_main_~#t1048~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1048~0.base, ULTIMATE.start_main_~#t1048~0.offset, #length] because there is no mapped edge [2019-12-27 21:08:46,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L4-->L820: Formula: (and (not (= P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1501832938 0)) (= ~z$r_buff0_thd4~0_Out-1501832938 1) (= ~z$r_buff1_thd2~0_Out-1501832938 ~z$r_buff0_thd2~0_In-1501832938) (= ~z$r_buff1_thd4~0_Out-1501832938 ~z$r_buff0_thd4~0_In-1501832938) (= ~z$r_buff0_thd3~0_In-1501832938 ~z$r_buff1_thd3~0_Out-1501832938) (= ~z$r_buff0_thd0~0_In-1501832938 ~z$r_buff1_thd0~0_Out-1501832938) (= ~z$r_buff1_thd1~0_Out-1501832938 ~z$r_buff0_thd1~0_In-1501832938) (= ~a~0_Out-1501832938 1) (= ~__unbuffered_p3_EBX~0_Out-1501832938 ~b~0_In-1501832938) (= ~a~0_Out-1501832938 ~__unbuffered_p3_EAX~0_Out-1501832938)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1501832938, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1501832938, ~b~0=~b~0_In-1501832938, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1501832938, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1501832938, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1501832938, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1501832938} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1501832938, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1501832938, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1501832938, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1501832938, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-1501832938, ~a~0=~a~0_Out-1501832938, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1501832938, ~b~0=~b~0_In-1501832938, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1501832938, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1501832938, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-1501832938, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1501832938, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1501832938, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1501832938, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1501832938} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 21:08:46,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_P0Thread1of1ForFork3_~arg.base_4 |v_P0Thread1of1ForFork3_#in~arg.base_4|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_4| v_P0Thread1of1ForFork3_~arg.offset_4) (= 1 v_~b~0_8) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_8) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~b~0=v_~b~0_8, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_4, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_4, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-27 21:08:46,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 1 v_~x~0_7) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 1 v_~y~0_8) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_8, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 21:08:46,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L778-->L778-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In275593152 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In275593152 256)))) (or (= (mod ~z$w_buff0_used~0_In275593152 256) 0) (and (= (mod ~z$r_buff1_thd3~0_In275593152 256) 0) .cse0) (and .cse0 (= (mod ~z$w_buff1_used~0_In275593152 256) 0)))) (= |P2Thread1of1ForFork1_#t~ite9_Out275593152| |P2Thread1of1ForFork1_#t~ite8_Out275593152|) .cse1 (= |P2Thread1of1ForFork1_#t~ite8_Out275593152| ~z$w_buff0~0_In275593152)) (and (= |P2Thread1of1ForFork1_#t~ite9_Out275593152| ~z$w_buff0~0_In275593152) (= |P2Thread1of1ForFork1_#t~ite8_In275593152| |P2Thread1of1ForFork1_#t~ite8_Out275593152|) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In275593152, ~z$w_buff0_used~0=~z$w_buff0_used~0_In275593152, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In275593152, ~z$w_buff1_used~0=~z$w_buff1_used~0_In275593152, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In275593152, ~weak$$choice2~0=~weak$$choice2~0_In275593152, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In275593152|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In275593152, ~z$w_buff0_used~0=~z$w_buff0_used~0_In275593152, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In275593152, ~z$w_buff1_used~0=~z$w_buff1_used~0_In275593152, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In275593152, ~weak$$choice2~0=~weak$$choice2~0_In275593152, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out275593152|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out275593152|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 21:08:46,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L779-->L779-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1535573481 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite11_In-1535573481| |P2Thread1of1ForFork1_#t~ite11_Out-1535573481|) (not .cse0) (= ~z$w_buff1~0_In-1535573481 |P2Thread1of1ForFork1_#t~ite12_Out-1535573481|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1535573481 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-1535573481 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1535573481 256))) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1535573481 256))))) .cse0 (= |P2Thread1of1ForFork1_#t~ite12_Out-1535573481| |P2Thread1of1ForFork1_#t~ite11_Out-1535573481|) (= ~z$w_buff1~0_In-1535573481 |P2Thread1of1ForFork1_#t~ite11_Out-1535573481|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1535573481, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1535573481, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In-1535573481|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1535573481, ~z$w_buff1~0=~z$w_buff1~0_In-1535573481, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1535573481, ~weak$$choice2~0=~weak$$choice2~0_In-1535573481} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1535573481, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-1535573481|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1535573481, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-1535573481|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1535573481, ~z$w_buff1~0=~z$w_buff1~0_In-1535573481, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1535573481, ~weak$$choice2~0=~weak$$choice2~0_In-1535573481} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 21:08:46,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1146823276 256)))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite14_Out1146823276| ~z$w_buff0_used~0_In1146823276) (= |P2Thread1of1ForFork1_#t~ite14_Out1146823276| |P2Thread1of1ForFork1_#t~ite15_Out1146823276|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1146823276 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In1146823276 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1146823276 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In1146823276 256)) .cse1)))) (and (= |P2Thread1of1ForFork1_#t~ite14_In1146823276| |P2Thread1of1ForFork1_#t~ite14_Out1146823276|) (not .cse0) (= ~z$w_buff0_used~0_In1146823276 |P2Thread1of1ForFork1_#t~ite15_Out1146823276|)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In1146823276|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1146823276, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1146823276, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1146823276, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1146823276, ~weak$$choice2~0=~weak$$choice2~0_In1146823276} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1146823276|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out1146823276|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1146823276, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1146823276, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1146823276, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1146823276, ~weak$$choice2~0=~weak$$choice2~0_In1146823276} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-27 21:08:46,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff0_thd3~0_47) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_9|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_20, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 21:08:46,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L783-->L783-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1505496725 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1505496725 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In1505496725 256)) .cse0) (and .cse0 (= (mod ~z$w_buff1_used~0_In1505496725 256) 0)) (= (mod ~z$w_buff0_used~0_In1505496725 256) 0))) .cse1 (= |P2Thread1of1ForFork1_#t~ite23_Out1505496725| ~z$r_buff1_thd3~0_In1505496725) (= |P2Thread1of1ForFork1_#t~ite23_Out1505496725| |P2Thread1of1ForFork1_#t~ite24_Out1505496725|)) (and (= |P2Thread1of1ForFork1_#t~ite23_In1505496725| |P2Thread1of1ForFork1_#t~ite23_Out1505496725|) (= |P2Thread1of1ForFork1_#t~ite24_Out1505496725| ~z$r_buff1_thd3~0_In1505496725) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1505496725, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1505496725, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In1505496725|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1505496725, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1505496725, ~weak$$choice2~0=~weak$$choice2~0_In1505496725} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out1505496725|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1505496725, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1505496725, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out1505496725|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1505496725, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1505496725, ~weak$$choice2~0=~weak$$choice2~0_In1505496725} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-27 21:08:46,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~z~0_13 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 21:08:46,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In573214776 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In573214776 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork2_#t~ite28_Out573214776|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In573214776 |P3Thread1of1ForFork2_#t~ite28_Out573214776|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In573214776, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In573214776} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out573214776|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In573214776, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In573214776} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 21:08:46,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd4~0_In901316987 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In901316987 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In901316987 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In901316987 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In901316987 |P3Thread1of1ForFork2_#t~ite29_Out901316987|) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite29_Out901316987|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In901316987, ~z$w_buff0_used~0=~z$w_buff0_used~0_In901316987, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In901316987, ~z$w_buff1_used~0=~z$w_buff1_used~0_In901316987} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out901316987|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In901316987, ~z$w_buff0_used~0=~z$w_buff0_used~0_In901316987, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In901316987, ~z$w_buff1_used~0=~z$w_buff1_used~0_In901316987} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 21:08:46,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In638530717 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In638530717 256) 0))) (or (and (not .cse0) (= ~z$r_buff0_thd4~0_Out638530717 0) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out638530717 ~z$r_buff0_thd4~0_In638530717) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In638530717, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In638530717} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In638530717, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out638530717, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out638530717|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-27 21:08:46,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd4~0_In-1378599497 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1378599497 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1378599497 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-1378599497 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite31_Out-1378599497| ~z$r_buff1_thd4~0_In-1378599497)) (and (= |P3Thread1of1ForFork2_#t~ite31_Out-1378599497| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1378599497, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1378599497, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1378599497, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1378599497} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1378599497, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1378599497, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1378599497, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1378599497, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-1378599497|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 21:08:46,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L824-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_8| v_~z$r_buff1_thd4~0_16) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_8|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_7|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 21:08:46,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_63 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_63, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_63, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 21:08:46,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In192100040 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In192100040 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite37_Out192100040| |ULTIMATE.start_main_#t~ite36_Out192100040|))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out192100040| ~z$w_buff1~0_In192100040) .cse2) (and (= |ULTIMATE.start_main_#t~ite36_Out192100040| ~z~0_In192100040) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In192100040, ~z$w_buff1_used~0=~z$w_buff1_used~0_In192100040, ~z$w_buff1~0=~z$w_buff1~0_In192100040, ~z~0=~z~0_In192100040} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In192100040, ~z$w_buff1_used~0=~z$w_buff1_used~0_In192100040, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out192100040|, ~z$w_buff1~0=~z$w_buff1~0_In192100040, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out192100040|, ~z~0=~z~0_In192100040} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 21:08:46,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In645107008 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In645107008 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out645107008| 0)) (and (= ~z$w_buff0_used~0_In645107008 |ULTIMATE.start_main_#t~ite38_Out645107008|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In645107008, ~z$w_buff0_used~0=~z$w_buff0_used~0_In645107008} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In645107008, ~z$w_buff0_used~0=~z$w_buff0_used~0_In645107008, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out645107008|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 21:08:46,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In123249758 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In123249758 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In123249758 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In123249758 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out123249758| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In123249758 |ULTIMATE.start_main_#t~ite39_Out123249758|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In123249758, ~z$w_buff0_used~0=~z$w_buff0_used~0_In123249758, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In123249758, ~z$w_buff1_used~0=~z$w_buff1_used~0_In123249758} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In123249758, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out123249758|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In123249758, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In123249758, ~z$w_buff1_used~0=~z$w_buff1_used~0_In123249758} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 21:08:46,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-799320611 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-799320611 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In-799320611 |ULTIMATE.start_main_#t~ite40_Out-799320611|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite40_Out-799320611|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-799320611, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-799320611} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-799320611, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-799320611|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-799320611} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 21:08:46,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1785694748 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1785694748 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1785694748 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1785694748 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In1785694748 |ULTIMATE.start_main_#t~ite41_Out1785694748|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite41_Out1785694748|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1785694748, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1785694748, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1785694748, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1785694748} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1785694748|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1785694748, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1785694748, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1785694748, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1785694748} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 21:08:46,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_9 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_8 256)) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~y~0_10 2) (= v_~main$tmp_guard1~0_8 0) (= |v_ULTIMATE.start_main_#t~ite41_11| v_~z$r_buff1_thd0~0_18) (= 0 v_~__unbuffered_p3_EBX~0_8) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= 1 v_~__unbuffered_p3_EAX~0_10)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_18, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, 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 21:08:46,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:08:46 BasicIcfg [2019-12-27 21:08:46,191 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:08:46,193 INFO L168 Benchmark]: Toolchain (without parser) took 31794.58 ms. Allocated memory was 145.2 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 101.7 MB in the beginning and 1.0 GB in the end (delta: -943.8 MB). Peak memory consumption was 396.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:08:46,195 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 21:08:46,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 796.24 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.3 MB in the beginning and 155.9 MB in the end (delta: -54.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:08:46,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.76 ms. Allocated memory is still 202.4 MB. Free memory was 155.9 MB in the beginning and 153.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:08:46,200 INFO L168 Benchmark]: Boogie Preprocessor took 37.43 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:08:46,201 INFO L168 Benchmark]: RCFGBuilder took 819.39 ms. Allocated memory is still 202.4 MB. Free memory was 151.3 MB in the beginning and 105.0 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:08:46,202 INFO L168 Benchmark]: TraceAbstraction took 30075.98 ms. Allocated memory was 202.4 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 104.4 MB in the beginning and 1.0 GB in the end (delta: -941.2 MB). Peak memory consumption was 341.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:08:46,209 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.55 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 796.24 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.3 MB in the beginning and 155.9 MB in the end (delta: -54.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.76 ms. Allocated memory is still 202.4 MB. Free memory was 155.9 MB in the beginning and 153.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.43 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 819.39 ms. Allocated memory is still 202.4 MB. Free memory was 151.3 MB in the beginning and 105.0 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30075.98 ms. Allocated memory was 202.4 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 104.4 MB in the beginning and 1.0 GB in the end (delta: -941.2 MB). Peak memory consumption was 341.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 170 ProgramPointsBefore, 75 ProgramPointsAfterwards, 192 TransitionsBefore, 79 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 28 ConcurrentYvCompositions, 23 ChoiceCompositions, 5608 VarBasedMoverChecksPositive, 130 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 45931 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t1045, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1046, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1047, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1048, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 2 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 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) [L778] 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)) [L779] 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)) [L780] 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)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_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)) [L783] 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)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 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) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 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 [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 29.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1892 SDtfs, 3612 SDslu, 3345 SDs, 0 SdLazy, 1342 SolverSat, 243 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31184occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 37624 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 476 NumberOfCodeBlocks, 476 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 411 ConstructedInterpolants, 0 QuantifiedInterpolants, 33075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...