/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/safe031_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:57:33,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:57:33,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:57:33,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:57:33,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:57:33,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:57:33,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:57:33,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:57:33,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:57:33,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:57:33,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:57:33,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:57:33,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:57:33,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:57:33,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:57:33,173 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:57:33,174 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:57:33,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:57:33,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:57:33,181 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:57:33,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:57:33,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:57:33,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:57:33,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:57:33,188 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:57:33,189 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:57:33,189 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:57:33,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:57:33,190 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:57:33,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:57:33,192 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:57:33,192 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:57:33,193 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:57:33,194 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:57:33,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:57:33,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:57:33,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:57:33,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:57:33,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:57:33,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:57:33,198 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:57:33,199 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 22:57:33,213 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:57:33,214 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:57:33,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:57:33,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:57:33,215 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:57:33,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:57:33,216 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:57:33,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:57:33,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:57:33,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:57:33,217 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:57:33,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:57:33,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:57:33,217 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:57:33,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:57:33,218 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:57:33,218 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:57:33,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:57:33,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:57:33,218 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:57:33,219 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:57:33,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:57:33,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:57:33,219 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:57:33,219 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:57:33,220 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:57:33,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:57:33,220 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:57:33,220 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:57:33,220 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:57:33,221 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:57:33,221 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:57:33,545 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:57:33,558 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:57:33,561 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:57:33,562 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:57:33,563 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:57:33,564 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i [2019-12-27 22:57:33,638 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cfafccfe/0365afd526fb48f398603764ed802fe2/FLAGcb83b19ab [2019-12-27 22:57:34,189 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:57:34,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i [2019-12-27 22:57:34,219 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cfafccfe/0365afd526fb48f398603764ed802fe2/FLAGcb83b19ab [2019-12-27 22:57:34,471 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cfafccfe/0365afd526fb48f398603764ed802fe2 [2019-12-27 22:57:34,480 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:57:34,482 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:57:34,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:57:34,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:57:34,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:57:34,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:57:34" (1/1) ... [2019-12-27 22:57:34,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15422b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:57:34, skipping insertion in model container [2019-12-27 22:57:34,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:57:34" (1/1) ... [2019-12-27 22:57:34,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:57:34,557 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:57:35,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:57:35,116 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:57:35,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:57:35,292 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:57:35,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:57:35 WrapperNode [2019-12-27 22:57:35,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:57:35,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:57:35,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:57:35,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:57:35,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:57:35" (1/1) ... [2019-12-27 22:57:35,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:57:35" (1/1) ... [2019-12-27 22:57:35,367 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:57:35,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:57:35,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:57:35,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:57:35,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:57:35" (1/1) ... [2019-12-27 22:57:35,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:57:35" (1/1) ... [2019-12-27 22:57:35,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:57:35" (1/1) ... [2019-12-27 22:57:35,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:57:35" (1/1) ... [2019-12-27 22:57:35,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:57:35" (1/1) ... [2019-12-27 22:57:35,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:57:35" (1/1) ... [2019-12-27 22:57:35,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:57:35" (1/1) ... [2019-12-27 22:57:35,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:57:35,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:57:35,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:57:35,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:57:35,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:57:35" (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 22:57:35,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:57:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:57:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:57:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:57:35,483 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:57:35,484 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:57:35,484 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:57:35,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:57:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:57:35,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:57:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:57:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:57:35,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:57:35,490 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 22:57:36,242 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:57:36,242 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:57:36,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:57:36 BoogieIcfgContainer [2019-12-27 22:57:36,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:57:36,246 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:57:36,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:57:36,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:57:36,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:57:34" (1/3) ... [2019-12-27 22:57:36,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b7a105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:57:36, skipping insertion in model container [2019-12-27 22:57:36,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:57:35" (2/3) ... [2019-12-27 22:57:36,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b7a105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:57:36, skipping insertion in model container [2019-12-27 22:57:36,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:57:36" (3/3) ... [2019-12-27 22:57:36,254 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_power.opt.i [2019-12-27 22:57:36,264 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:57:36,265 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:57:36,274 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:57:36,275 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:57:36,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,314 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,314 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,316 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,317 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,331 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,332 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,332 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,332 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,333 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,350 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,351 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,352 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,357 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,357 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,359 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,359 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:57:36,392 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:57:36,413 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:57:36,413 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:57:36,413 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:57:36,413 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:57:36,413 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:57:36,414 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:57:36,414 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:57:36,414 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:57:36,432 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 22:57:36,434 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 22:57:36,538 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 22:57:36,539 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:57:36,557 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:57:36,578 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 22:57:36,655 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 22:57:36,655 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:57:36,661 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:57:36,675 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 22:57:36,676 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:57:39,881 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 22:57:40,000 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 22:57:40,022 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50143 [2019-12-27 22:57:40,023 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 22:57:40,026 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 93 transitions [2019-12-27 22:57:41,074 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16438 states. [2019-12-27 22:57:41,076 INFO L276 IsEmpty]: Start isEmpty. Operand 16438 states. [2019-12-27 22:57:41,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 22:57:41,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:41,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:57:41,084 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:57:41,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:41,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1237806690, now seen corresponding path program 1 times [2019-12-27 22:57:41,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:41,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798100342] [2019-12-27 22:57:41,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:57:41,369 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 22:57:41,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798100342] [2019-12-27 22:57:41,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:57:41,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:57:41,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [998635269] [2019-12-27 22:57:41,374 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:57:41,381 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:57:41,397 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 22:57:41,398 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:57:41,403 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:57:41,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:57:41,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:57:41,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:57:41,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:57:41,421 INFO L87 Difference]: Start difference. First operand 16438 states. Second operand 3 states. [2019-12-27 22:57:41,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:41,947 INFO L93 Difference]: Finished difference Result 16294 states and 61568 transitions. [2019-12-27 22:57:41,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:57:41,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 22:57:41,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:42,176 INFO L225 Difference]: With dead ends: 16294 [2019-12-27 22:57:42,177 INFO L226 Difference]: Without dead ends: 15956 [2019-12-27 22:57:42,178 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 22:57:42,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15956 states. [2019-12-27 22:57:43,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15956 to 15956. [2019-12-27 22:57:43,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15956 states. [2019-12-27 22:57:43,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15956 states to 15956 states and 60359 transitions. [2019-12-27 22:57:43,563 INFO L78 Accepts]: Start accepts. Automaton has 15956 states and 60359 transitions. Word has length 7 [2019-12-27 22:57:43,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:43,564 INFO L462 AbstractCegarLoop]: Abstraction has 15956 states and 60359 transitions. [2019-12-27 22:57:43,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:57:43,565 INFO L276 IsEmpty]: Start isEmpty. Operand 15956 states and 60359 transitions. [2019-12-27 22:57:43,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:57:43,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:43,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:57:43,575 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:57:43,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:43,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1710281022, now seen corresponding path program 1 times [2019-12-27 22:57:43,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:43,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977412115] [2019-12-27 22:57:43,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:57:43,700 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 22:57:43,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977412115] [2019-12-27 22:57:43,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:57:43,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:57:43,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1962807541] [2019-12-27 22:57:43,701 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:57:43,703 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:57:43,711 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 37 transitions. [2019-12-27 22:57:43,712 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:57:43,713 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:57:43,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:57:43,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:57:43,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:57:43,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:57:43,716 INFO L87 Difference]: Start difference. First operand 15956 states and 60359 transitions. Second operand 4 states. [2019-12-27 22:57:44,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:44,444 INFO L93 Difference]: Finished difference Result 25372 states and 91919 transitions. [2019-12-27 22:57:44,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:57:44,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:57:44,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:44,747 INFO L225 Difference]: With dead ends: 25372 [2019-12-27 22:57:44,747 INFO L226 Difference]: Without dead ends: 25358 [2019-12-27 22:57:44,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:57:44,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25358 states. [2019-12-27 22:57:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25358 to 22934. [2019-12-27 22:57:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22934 states. [2019-12-27 22:57:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22934 states to 22934 states and 84256 transitions. [2019-12-27 22:57:46,547 INFO L78 Accepts]: Start accepts. Automaton has 22934 states and 84256 transitions. Word has length 13 [2019-12-27 22:57:46,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:46,547 INFO L462 AbstractCegarLoop]: Abstraction has 22934 states and 84256 transitions. [2019-12-27 22:57:46,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:57:46,547 INFO L276 IsEmpty]: Start isEmpty. Operand 22934 states and 84256 transitions. [2019-12-27 22:57:46,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:57:46,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:46,549 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:57:46,549 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:57:46,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:46,550 INFO L82 PathProgramCache]: Analyzing trace with hash 294680669, now seen corresponding path program 1 times [2019-12-27 22:57:46,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:46,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672520224] [2019-12-27 22:57:46,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:57:46,597 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 22:57:46,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672520224] [2019-12-27 22:57:46,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:57:46,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:57:46,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1386576113] [2019-12-27 22:57:46,599 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:57:46,600 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:57:46,602 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:57:46,602 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:57:46,602 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:57:46,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:57:46,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:57:46,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:57:46,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:57:46,604 INFO L87 Difference]: Start difference. First operand 22934 states and 84256 transitions. Second operand 3 states. [2019-12-27 22:57:46,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:46,673 INFO L93 Difference]: Finished difference Result 13067 states and 41594 transitions. [2019-12-27 22:57:46,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:57:46,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:57:46,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:46,720 INFO L225 Difference]: With dead ends: 13067 [2019-12-27 22:57:46,721 INFO L226 Difference]: Without dead ends: 13067 [2019-12-27 22:57:46,721 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 22:57:46,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13067 states. [2019-12-27 22:57:47,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13067 to 13067. [2019-12-27 22:57:47,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13067 states. [2019-12-27 22:57:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13067 states to 13067 states and 41594 transitions. [2019-12-27 22:57:47,080 INFO L78 Accepts]: Start accepts. Automaton has 13067 states and 41594 transitions. Word has length 13 [2019-12-27 22:57:47,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:47,081 INFO L462 AbstractCegarLoop]: Abstraction has 13067 states and 41594 transitions. [2019-12-27 22:57:47,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:57:47,081 INFO L276 IsEmpty]: Start isEmpty. Operand 13067 states and 41594 transitions. [2019-12-27 22:57:47,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:57:47,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:47,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:57:47,083 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:57:47,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:47,083 INFO L82 PathProgramCache]: Analyzing trace with hash 217378403, now seen corresponding path program 1 times [2019-12-27 22:57:47,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:47,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235351728] [2019-12-27 22:57:47,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:57:47,271 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 22:57:47,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235351728] [2019-12-27 22:57:47,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:57:47,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:57:47,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [554818098] [2019-12-27 22:57:47,273 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:57:47,274 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:57:47,276 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 22:57:47,277 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:57:47,354 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:57:47,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:57:47,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:57:47,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:57:47,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:57:47,356 INFO L87 Difference]: Start difference. First operand 13067 states and 41594 transitions. Second operand 6 states. [2019-12-27 22:57:47,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:47,405 INFO L93 Difference]: Finished difference Result 1935 states and 4552 transitions. [2019-12-27 22:57:47,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:57:47,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-12-27 22:57:47,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:47,413 INFO L225 Difference]: With dead ends: 1935 [2019-12-27 22:57:47,414 INFO L226 Difference]: Without dead ends: 1935 [2019-12-27 22:57:47,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:57:47,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-27 22:57:47,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-27 22:57:47,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-27 22:57:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 4552 transitions. [2019-12-27 22:57:47,448 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 4552 transitions. Word has length 14 [2019-12-27 22:57:47,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:47,448 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 4552 transitions. [2019-12-27 22:57:47,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:57:47,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 4552 transitions. [2019-12-27 22:57:47,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 22:57:47,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:47,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:57:47,451 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:57:47,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:47,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1829602713, now seen corresponding path program 1 times [2019-12-27 22:57:47,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:47,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750087429] [2019-12-27 22:57:47,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:57:47,550 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 22:57:47,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750087429] [2019-12-27 22:57:47,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:57:47,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:57:47,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1549594366] [2019-12-27 22:57:47,551 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:57:47,555 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:57:47,566 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 78 transitions. [2019-12-27 22:57:47,567 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:57:47,620 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:57:47,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:57:47,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:57:47,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:57:47,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:57:47,622 INFO L87 Difference]: Start difference. First operand 1935 states and 4552 transitions. Second operand 7 states. [2019-12-27 22:57:47,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:47,678 INFO L93 Difference]: Finished difference Result 629 states and 1474 transitions. [2019-12-27 22:57:47,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:57:47,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-12-27 22:57:47,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:47,681 INFO L225 Difference]: With dead ends: 629 [2019-12-27 22:57:47,681 INFO L226 Difference]: Without dead ends: 629 [2019-12-27 22:57:47,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:57:47,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-12-27 22:57:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 573. [2019-12-27 22:57:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-12-27 22:57:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1342 transitions. [2019-12-27 22:57:47,691 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1342 transitions. Word has length 26 [2019-12-27 22:57:47,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:47,692 INFO L462 AbstractCegarLoop]: Abstraction has 573 states and 1342 transitions. [2019-12-27 22:57:47,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:57:47,692 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1342 transitions. [2019-12-27 22:57:47,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:57:47,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:47,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:57:47,697 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:57:47,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:47,698 INFO L82 PathProgramCache]: Analyzing trace with hash -572389292, now seen corresponding path program 1 times [2019-12-27 22:57:47,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:47,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874030313] [2019-12-27 22:57:47,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:57:47,817 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 22:57:47,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874030313] [2019-12-27 22:57:47,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:57:47,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:57:47,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1454338263] [2019-12-27 22:57:47,819 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:57:47,840 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:57:47,885 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 104 transitions. [2019-12-27 22:57:47,886 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:57:47,886 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:57:47,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:57:47,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:57:47,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:57:47,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:57:47,888 INFO L87 Difference]: Start difference. First operand 573 states and 1342 transitions. Second operand 3 states. [2019-12-27 22:57:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:47,937 INFO L93 Difference]: Finished difference Result 583 states and 1352 transitions. [2019-12-27 22:57:47,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:57:47,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 22:57:47,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:47,945 INFO L225 Difference]: With dead ends: 583 [2019-12-27 22:57:47,945 INFO L226 Difference]: Without dead ends: 583 [2019-12-27 22:57:47,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:57:47,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-12-27 22:57:47,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 579. [2019-12-27 22:57:47,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-12-27 22:57:47,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1348 transitions. [2019-12-27 22:57:47,955 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1348 transitions. Word has length 55 [2019-12-27 22:57:47,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:47,955 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 1348 transitions. [2019-12-27 22:57:47,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:57:47,956 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1348 transitions. [2019-12-27 22:57:47,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:57:47,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:47,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:57:47,958 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:57:47,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:47,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1691317009, now seen corresponding path program 1 times [2019-12-27 22:57:47,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:47,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967775323] [2019-12-27 22:57:47,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:57:48,133 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 22:57:48,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967775323] [2019-12-27 22:57:48,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:57:48,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:57:48,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1001840542] [2019-12-27 22:57:48,135 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:57:48,155 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:57:48,203 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 104 transitions. [2019-12-27 22:57:48,203 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:57:48,209 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:57:48,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:57:48,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:57:48,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:57:48,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:57:48,210 INFO L87 Difference]: Start difference. First operand 579 states and 1348 transitions. Second operand 6 states. [2019-12-27 22:57:48,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:48,571 INFO L93 Difference]: Finished difference Result 932 states and 2170 transitions. [2019-12-27 22:57:48,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 22:57:48,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 22:57:48,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:48,574 INFO L225 Difference]: With dead ends: 932 [2019-12-27 22:57:48,577 INFO L226 Difference]: Without dead ends: 932 [2019-12-27 22:57:48,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:57:48,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2019-12-27 22:57:48,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 737. [2019-12-27 22:57:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-12-27 22:57:48,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1731 transitions. [2019-12-27 22:57:48,593 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1731 transitions. Word has length 55 [2019-12-27 22:57:48,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:48,593 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1731 transitions. [2019-12-27 22:57:48,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:57:48,593 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1731 transitions. [2019-12-27 22:57:48,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:57:48,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:48,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:57:48,596 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:57:48,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:48,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1786469187, now seen corresponding path program 2 times [2019-12-27 22:57:48,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:48,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446117086] [2019-12-27 22:57:48,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:57:48,795 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 22:57:48,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446117086] [2019-12-27 22:57:48,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:57:48,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:57:48,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1901096638] [2019-12-27 22:57:48,798 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:57:48,817 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:57:48,863 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 112 transitions. [2019-12-27 22:57:48,863 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:57:48,959 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 22:57:48,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:57:48,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:57:48,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:57:48,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:57:48,960 INFO L87 Difference]: Start difference. First operand 737 states and 1731 transitions. Second operand 10 states. [2019-12-27 22:57:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:50,075 INFO L93 Difference]: Finished difference Result 1763 states and 3917 transitions. [2019-12-27 22:57:50,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 22:57:50,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-27 22:57:50,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:50,078 INFO L225 Difference]: With dead ends: 1763 [2019-12-27 22:57:50,079 INFO L226 Difference]: Without dead ends: 1763 [2019-12-27 22:57:50,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2019-12-27 22:57:50,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2019-12-27 22:57:50,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 815. [2019-12-27 22:57:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-12-27 22:57:50,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1928 transitions. [2019-12-27 22:57:50,098 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1928 transitions. Word has length 55 [2019-12-27 22:57:50,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:50,098 INFO L462 AbstractCegarLoop]: Abstraction has 815 states and 1928 transitions. [2019-12-27 22:57:50,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:57:50,098 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1928 transitions. [2019-12-27 22:57:50,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:57:50,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:50,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:57:50,101 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:57:50,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:50,101 INFO L82 PathProgramCache]: Analyzing trace with hash -711503501, now seen corresponding path program 3 times [2019-12-27 22:57:50,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:50,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025530753] [2019-12-27 22:57:50,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:57:50,215 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 22:57:50,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025530753] [2019-12-27 22:57:50,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:57:50,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:57:50,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1574866822] [2019-12-27 22:57:50,217 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:57:50,235 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:57:50,276 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 104 transitions. [2019-12-27 22:57:50,276 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:57:50,398 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2019-12-27 22:57:50,442 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 22:57:50,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:57:50,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:57:50,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:57:50,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:57:50,443 INFO L87 Difference]: Start difference. First operand 815 states and 1928 transitions. Second operand 11 states. [2019-12-27 22:57:51,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:51,803 INFO L93 Difference]: Finished difference Result 1791 states and 3983 transitions. [2019-12-27 22:57:51,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 22:57:51,804 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-27 22:57:51,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:51,809 INFO L225 Difference]: With dead ends: 1791 [2019-12-27 22:57:51,810 INFO L226 Difference]: Without dead ends: 1791 [2019-12-27 22:57:51,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2019-12-27 22:57:51,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2019-12-27 22:57:51,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 773. [2019-12-27 22:57:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-27 22:57:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1825 transitions. [2019-12-27 22:57:51,832 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1825 transitions. Word has length 55 [2019-12-27 22:57:51,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:51,835 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1825 transitions. [2019-12-27 22:57:51,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:57:51,835 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1825 transitions. [2019-12-27 22:57:51,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:57:51,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:51,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:57:51,838 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:57:51,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:51,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1277139988, now seen corresponding path program 1 times [2019-12-27 22:57:51,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:51,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785177744] [2019-12-27 22:57:51,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:57:52,044 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 22:57:52,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785177744] [2019-12-27 22:57:52,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:57:52,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:57:52,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1425960697] [2019-12-27 22:57:52,046 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:57:52,065 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:57:52,112 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 105 transitions. [2019-12-27 22:57:52,112 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:57:52,160 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:57:52,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:57:52,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:57:52,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:57:52,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:57:52,161 INFO L87 Difference]: Start difference. First operand 773 states and 1825 transitions. Second operand 10 states. [2019-12-27 22:57:52,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:52,914 INFO L93 Difference]: Finished difference Result 1411 states and 3206 transitions. [2019-12-27 22:57:52,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 22:57:52,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-27 22:57:52,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:52,917 INFO L225 Difference]: With dead ends: 1411 [2019-12-27 22:57:52,917 INFO L226 Difference]: Without dead ends: 1411 [2019-12-27 22:57:52,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:57:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2019-12-27 22:57:52,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 683. [2019-12-27 22:57:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2019-12-27 22:57:52,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1580 transitions. [2019-12-27 22:57:52,934 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1580 transitions. Word has length 56 [2019-12-27 22:57:52,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:52,934 INFO L462 AbstractCegarLoop]: Abstraction has 683 states and 1580 transitions. [2019-12-27 22:57:52,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:57:52,934 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1580 transitions. [2019-12-27 22:57:52,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:57:52,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:52,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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:57:52,937 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:57:52,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:52,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1226115994, now seen corresponding path program 2 times [2019-12-27 22:57:52,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:52,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882226410] [2019-12-27 22:57:52,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:57:53,090 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 22:57:53,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882226410] [2019-12-27 22:57:53,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:57:53,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:57:53,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2048968071] [2019-12-27 22:57:53,092 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:57:53,115 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:57:53,230 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 109 transitions. [2019-12-27 22:57:53,231 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:57:53,231 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:57:53,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:57:53,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:57:53,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:57:53,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:57:53,232 INFO L87 Difference]: Start difference. First operand 683 states and 1580 transitions. Second operand 7 states. [2019-12-27 22:57:53,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:53,338 INFO L93 Difference]: Finished difference Result 1156 states and 2529 transitions. [2019-12-27 22:57:53,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 22:57:53,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-27 22:57:53,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:53,340 INFO L225 Difference]: With dead ends: 1156 [2019-12-27 22:57:53,340 INFO L226 Difference]: Without dead ends: 446 [2019-12-27 22:57:53,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:57:53,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-12-27 22:57:53,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 382. [2019-12-27 22:57:53,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-12-27 22:57:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 694 transitions. [2019-12-27 22:57:53,348 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 694 transitions. Word has length 56 [2019-12-27 22:57:53,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:53,348 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 694 transitions. [2019-12-27 22:57:53,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:57:53,349 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 694 transitions. [2019-12-27 22:57:53,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:57:53,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:53,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:57:53,350 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:57:53,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:53,351 INFO L82 PathProgramCache]: Analyzing trace with hash 646837790, now seen corresponding path program 1 times [2019-12-27 22:57:53,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:53,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941252378] [2019-12-27 22:57:53,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:57:53,430 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 22:57:53,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941252378] [2019-12-27 22:57:53,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:57:53,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:57:53,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [446889498] [2019-12-27 22:57:53,431 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:57:53,447 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:57:53,490 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 112 transitions. [2019-12-27 22:57:53,491 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:57:53,502 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:57:53,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:57:53,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:57:53,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:57:53,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:57:53,503 INFO L87 Difference]: Start difference. First operand 382 states and 694 transitions. Second operand 4 states. [2019-12-27 22:57:53,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:53,611 INFO L93 Difference]: Finished difference Result 441 states and 781 transitions. [2019-12-27 22:57:53,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:57:53,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-27 22:57:53,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:53,612 INFO L225 Difference]: With dead ends: 441 [2019-12-27 22:57:53,612 INFO L226 Difference]: Without dead ends: 441 [2019-12-27 22:57:53,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 22:57:53,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-12-27 22:57:53,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 372. [2019-12-27 22:57:53,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-12-27 22:57:53,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 669 transitions. [2019-12-27 22:57:53,620 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 669 transitions. Word has length 56 [2019-12-27 22:57:53,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:53,620 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 669 transitions. [2019-12-27 22:57:53,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:57:53,620 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 669 transitions. [2019-12-27 22:57:53,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:57:53,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:53,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:57:53,622 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:57:53,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:53,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1815043520, now seen corresponding path program 3 times [2019-12-27 22:57:53,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:53,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214331904] [2019-12-27 22:57:53,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:57:53,693 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 22:57:53,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214331904] [2019-12-27 22:57:53,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:57:53,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:57:53,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [130246560] [2019-12-27 22:57:53,695 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:57:53,728 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:57:53,776 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 122 transitions. [2019-12-27 22:57:53,777 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:57:53,777 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:57:53,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:57:53,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:57:53,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:57:53,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:57:53,778 INFO L87 Difference]: Start difference. First operand 372 states and 669 transitions. Second operand 3 states. [2019-12-27 22:57:53,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:53,830 INFO L93 Difference]: Finished difference Result 372 states and 668 transitions. [2019-12-27 22:57:53,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:57:53,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 22:57:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:53,832 INFO L225 Difference]: With dead ends: 372 [2019-12-27 22:57:53,832 INFO L226 Difference]: Without dead ends: 372 [2019-12-27 22:57:53,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:57:53,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-27 22:57:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 285. [2019-12-27 22:57:53,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-12-27 22:57:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 506 transitions. [2019-12-27 22:57:53,842 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 506 transitions. Word has length 56 [2019-12-27 22:57:53,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:53,843 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 506 transitions. [2019-12-27 22:57:53,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:57:53,843 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 506 transitions. [2019-12-27 22:57:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 22:57:53,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:53,845 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:57:53,845 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:57:53,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:53,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1847274299, now seen corresponding path program 1 times [2019-12-27 22:57:53,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:53,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592946573] [2019-12-27 22:57:53,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:57:54,194 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 22:57:54,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592946573] [2019-12-27 22:57:54,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:57:54,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 22:57:54,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1075727491] [2019-12-27 22:57:54,196 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:57:54,212 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:57:54,342 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 111 transitions. [2019-12-27 22:57:54,342 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:57:54,379 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:57:54,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 22:57:54,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:57:54,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 22:57:54,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 22:57:54,380 INFO L87 Difference]: Start difference. First operand 285 states and 506 transitions. Second operand 14 states. [2019-12-27 22:57:55,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:55,043 INFO L93 Difference]: Finished difference Result 488 states and 846 transitions. [2019-12-27 22:57:55,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 22:57:55,043 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-27 22:57:55,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:55,044 INFO L225 Difference]: With dead ends: 488 [2019-12-27 22:57:55,044 INFO L226 Difference]: Without dead ends: 456 [2019-12-27 22:57:55,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 22:57:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-12-27 22:57:55,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 385. [2019-12-27 22:57:55,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-12-27 22:57:55,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 677 transitions. [2019-12-27 22:57:55,051 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 677 transitions. Word has length 57 [2019-12-27 22:57:55,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:55,051 INFO L462 AbstractCegarLoop]: Abstraction has 385 states and 677 transitions. [2019-12-27 22:57:55,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 22:57:55,052 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 677 transitions. [2019-12-27 22:57:55,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 22:57:55,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:55,053 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:57:55,053 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:57:55,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:55,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1476167727, now seen corresponding path program 2 times [2019-12-27 22:57:55,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:55,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605303198] [2019-12-27 22:57:55,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:57:55,306 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 22:57:55,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605303198] [2019-12-27 22:57:55,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:57:55,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 22:57:55,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [325072486] [2019-12-27 22:57:55,307 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:57:55,322 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:57:55,383 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 105 states and 148 transitions. [2019-12-27 22:57:55,384 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:57:55,437 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 22:57:55,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:57:55,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:57:55,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:57:55,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:57:55,438 INFO L87 Difference]: Start difference. First operand 385 states and 677 transitions. Second operand 13 states. [2019-12-27 22:57:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:55,913 INFO L93 Difference]: Finished difference Result 522 states and 897 transitions. [2019-12-27 22:57:55,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 22:57:55,914 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 22:57:55,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:55,915 INFO L225 Difference]: With dead ends: 522 [2019-12-27 22:57:55,915 INFO L226 Difference]: Without dead ends: 490 [2019-12-27 22:57:55,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-12-27 22:57:55,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-12-27 22:57:55,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 393. [2019-12-27 22:57:55,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-12-27 22:57:55,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 691 transitions. [2019-12-27 22:57:55,923 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 691 transitions. Word has length 57 [2019-12-27 22:57:55,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:55,924 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 691 transitions. [2019-12-27 22:57:55,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:57:55,924 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 691 transitions. [2019-12-27 22:57:55,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 22:57:55,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:55,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:57:55,925 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:57:55,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:55,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1248889277, now seen corresponding path program 3 times [2019-12-27 22:57:55,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:55,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421907117] [2019-12-27 22:57:55,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:57:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:57:56,040 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:57:56,040 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:57:56,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~y$w_buff1~0_28) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t2516~0.base_22| 1)) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd2~0_20 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd0~0_79 0) (= 0 v_~__unbuffered_p0_EAX~0_12) (= v_~z~0_14 0) (= 0 v_~y$w_buff0~0_28) (= v_~y$r_buff0_thd1~0_9 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2516~0.base_22|) 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_34) (= v_~x~0_10 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2516~0.base_22|) (= v_~y$r_buff0_thd3~0_26 0) (= 0 v_~y$r_buff1_thd2~0_19) (= v_~y$r_buff1_thd1~0_9 0) (= 0 v_~__unbuffered_cnt~0_23) (= v_~y~0_27 0) (= 0 v_~y$r_buff1_thd0~0_50) (= v_~y$w_buff1_used~0_68 0) (= 0 |v_#NULL.base_4|) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_4| 0) (= 0 |v_ULTIMATE.start_main_~#t2516~0.offset_17|) (= v_~y$w_buff0_used~0_107 0) (= v_~y$mem_tmp~0_10 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2516~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2516~0.base_22|) |v_ULTIMATE.start_main_~#t2516~0.offset_17| 0)) |v_#memory_int_19|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t2516~0.base_22| 4) |v_#length_21|) (= 0 v_~y$r_buff1_thd3~0_19) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~y$flush_delayed~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_9|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_~#t2516~0.base=|v_ULTIMATE.start_main_~#t2516~0.base_22|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t2517~0.offset=|v_ULTIMATE.start_main_~#t2517~0.offset_15|, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_21|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_7|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_11|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y$w_buff1~0=v_~y$w_buff1~0_28, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_50, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t2516~0.offset=|v_ULTIMATE.start_main_~#t2516~0.offset_17|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_107, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_14|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_9|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_11|, ~y$w_buff0~0=v_~y$w_buff0~0_28, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y~0=v_~y~0_27, ULTIMATE.start_main_~#t2518~0.base=|v_ULTIMATE.start_main_~#t2518~0.base_18|, ULTIMATE.start_main_~#t2517~0.base=|v_ULTIMATE.start_main_~#t2517~0.base_19|, ULTIMATE.start_main_~#t2518~0.offset=|v_ULTIMATE.start_main_~#t2518~0.offset_15|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_11|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_7|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_11|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_79, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t2516~0.base, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t2517~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t2516~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t2518~0.base, ULTIMATE.start_main_~#t2517~0.base, ULTIMATE.start_main_~#t2518~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:57:56,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L802-1-->L804: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2517~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2517~0.base_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2517~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2517~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2517~0.base_11|) |v_ULTIMATE.start_main_~#t2517~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2517~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t2517~0.base_11| 0)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2517~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2517~0.offset=|v_ULTIMATE.start_main_~#t2517~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t2517~0.base=|v_ULTIMATE.start_main_~#t2517~0.base_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2517~0.offset, ULTIMATE.start_main_~#t2517~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 22:57:56,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L804-1-->L806: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2518~0.base_10| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2518~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2518~0.base_10|) |v_ULTIMATE.start_main_~#t2518~0.offset_10| 2)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2518~0.base_10|)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2518~0.base_10|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2518~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t2518~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2518~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2518~0.offset=|v_ULTIMATE.start_main_~#t2518~0.offset_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2518~0.base=|v_ULTIMATE.start_main_~#t2518~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2518~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t2518~0.base] because there is no mapped edge [2019-12-27 22:57:56,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [616] [616] P2ENTRY-->L4-3: Formula: (and (= (mod v_~y$w_buff1_used~0_43 256) 0) (= 1 v_~y$w_buff0_used~0_73) (= 2 v_~y$w_buff0~0_16) (= v_~y$w_buff0~0_17 v_~y$w_buff1~0_13) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_~y$w_buff1_used~0_43 v_~y$w_buff0_used~0_74) (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_74, ~y$w_buff0~0=v_~y$w_buff0~0_17, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_73, ~y$w_buff1~0=v_~y$w_buff1~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_16, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_43} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:57:56,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_10 2) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_6) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_6} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~z~0=v_~z~0_10, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_6, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 22:57:56,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1524283025 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1524283025 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite11_Out-1524283025|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1524283025 |P2Thread1of1ForFork0_#t~ite11_Out-1524283025|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1524283025, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1524283025} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1524283025, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-1524283025|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1524283025} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 22:57:56,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L750-2-->L750-5: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-1234122336 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1234122336 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite4_Out-1234122336| |P1Thread1of1ForFork2_#t~ite3_Out-1234122336|))) (or (and (= ~y~0_In-1234122336 |P1Thread1of1ForFork2_#t~ite3_Out-1234122336|) (or .cse0 .cse1) .cse2) (and (= |P1Thread1of1ForFork2_#t~ite3_Out-1234122336| ~y$w_buff1~0_In-1234122336) (not .cse1) (not .cse0) .cse2))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1234122336, ~y$w_buff1~0=~y$w_buff1~0_In-1234122336, ~y~0=~y~0_In-1234122336, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1234122336} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1234122336, ~y$w_buff1~0=~y$w_buff1~0_In-1234122336, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out-1234122336|, ~y~0=~y~0_In-1234122336, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-1234122336|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1234122336} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 22:57:56,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L751-->L751-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In82583531 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In82583531 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite5_Out82583531| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite5_Out82583531| ~y$w_buff0_used~0_In82583531) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In82583531, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In82583531} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In82583531, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In82583531, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out82583531|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 22:57:56,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In267492790 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In267492790 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In267492790 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In267492790 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite12_Out267492790|)) (and (= ~y$w_buff1_used~0_In267492790 |P2Thread1of1ForFork0_#t~ite12_Out267492790|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In267492790, ~y$w_buff0_used~0=~y$w_buff0_used~0_In267492790, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In267492790, ~y$w_buff1_used~0=~y$w_buff1_used~0_In267492790} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In267492790, ~y$w_buff0_used~0=~y$w_buff0_used~0_In267492790, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out267492790|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In267492790, ~y$w_buff1_used~0=~y$w_buff1_used~0_In267492790} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 22:57:56,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L752-->L752-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In-1136283827 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1136283827 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1136283827 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1136283827 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite6_Out-1136283827| ~y$w_buff1_used~0_In-1136283827)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork2_#t~ite6_Out-1136283827| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1136283827, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1136283827, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1136283827, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1136283827} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1136283827, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1136283827, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1136283827, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-1136283827|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1136283827} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 22:57:56,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L753-->L753-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1258252025 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1258252025 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite7_Out-1258252025|) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In-1258252025 |P1Thread1of1ForFork2_#t~ite7_Out-1258252025|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1258252025, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1258252025} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1258252025, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1258252025, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-1258252025|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 22:57:56,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L754-->L754-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-12399484 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-12399484 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-12399484 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-12399484 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In-12399484 |P1Thread1of1ForFork2_#t~ite8_Out-12399484|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite8_Out-12399484|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-12399484, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-12399484, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-12399484, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-12399484} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-12399484, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-12399484, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-12399484|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-12399484, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-12399484} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 22:57:56,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L754-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_8| v_~y$r_buff1_thd2~0_15) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 22:57:56,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L782-->L783: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-2027228465 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2027228465 256)))) (or (and (not .cse0) (= ~y$r_buff0_thd3~0_Out-2027228465 0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_In-2027228465 ~y$r_buff0_thd3~0_Out-2027228465) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2027228465, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2027228465} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2027228465, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-2027228465, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-2027228465|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 22:57:56,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1304590977 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1304590977 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1304590977 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1304590977 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite14_Out1304590977| 0)) (and (= |P2Thread1of1ForFork0_#t~ite14_Out1304590977| ~y$r_buff1_thd3~0_In1304590977) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1304590977, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1304590977, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1304590977, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1304590977} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1304590977|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1304590977, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1304590977, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1304590977, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1304590977} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 22:57:56,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L783-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~y$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork0_#t~ite14_8|)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 22:57:56,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [614] [614] L806-1-->L812: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_3|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 22:57:56,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L812-2-->L812-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite18_Out1123199123| |ULTIMATE.start_main_#t~ite19_Out1123199123|)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1123199123 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1123199123 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In1123199123 |ULTIMATE.start_main_#t~ite18_Out1123199123|) (not .cse1) .cse2) (and .cse2 (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite18_Out1123199123| ~y~0_In1123199123)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1123199123, ~y~0=~y~0_In1123199123, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1123199123, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1123199123} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1123199123, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1123199123|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1123199123|, ~y~0=~y~0_In1123199123, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1123199123, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1123199123} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 22:57:56,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In954291957 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In954291957 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite20_Out954291957|)) (and (= ~y$w_buff0_used~0_In954291957 |ULTIMATE.start_main_#t~ite20_Out954291957|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In954291957, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In954291957} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In954291957, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In954291957, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out954291957|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 22:57:56,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1112286137 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1112286137 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1112286137 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1112286137 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-1112286137|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1112286137 |ULTIMATE.start_main_#t~ite21_Out-1112286137|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1112286137, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1112286137, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1112286137, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1112286137} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1112286137, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1112286137, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1112286137|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1112286137, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1112286137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 22:57:56,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In522065732 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In522065732 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out522065732| ~y$r_buff0_thd0~0_In522065732) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite22_Out522065732|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In522065732, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In522065732} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In522065732, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In522065732, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out522065732|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 22:57:56,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In1760157590 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1760157590 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1760157590 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1760157590 256)))) (or (and (= ~y$r_buff1_thd0~0_In1760157590 |ULTIMATE.start_main_#t~ite23_Out1760157590|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite23_Out1760157590|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1760157590, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1760157590, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1760157590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1760157590} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1760157590, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1760157590, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1760157590, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1760157590|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1760157590} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 22:57:56,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L827-->L827-8: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1900496736 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1900496736 256) 0)) (.cse4 (= 0 (mod ~y$r_buff1_thd0~0_In-1900496736 256))) (.cse5 (= |ULTIMATE.start_main_#t~ite39_Out-1900496736| |ULTIMATE.start_main_#t~ite38_Out-1900496736|)) (.cse0 (= 0 (mod ~weak$$choice2~0_In-1900496736 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1900496736 256) 0))) (or (and (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In-1900496736| |ULTIMATE.start_main_#t~ite38_Out-1900496736|) (= |ULTIMATE.start_main_#t~ite39_Out-1900496736| ~y$w_buff1_used~0_In-1900496736)) (and (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4)) (= |ULTIMATE.start_main_#t~ite38_Out-1900496736| ~y$w_buff1_used~0_In-1900496736) .cse5 .cse0)) (= |ULTIMATE.start_main_#t~ite37_In-1900496736| |ULTIMATE.start_main_#t~ite37_Out-1900496736|)) (let ((.cse6 (not .cse1))) (and (or .cse6 (not .cse2)) (= |ULTIMATE.start_main_#t~ite37_Out-1900496736| 0) (= |ULTIMATE.start_main_#t~ite38_Out-1900496736| |ULTIMATE.start_main_#t~ite37_Out-1900496736|) (not .cse3) (or .cse6 (not .cse4)) .cse5 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1900496736, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1900496736, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-1900496736|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In-1900496736|, ~weak$$choice2~0=~weak$$choice2~0_In-1900496736, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1900496736, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1900496736} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1900496736, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1900496736|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1900496736, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1900496736|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1900496736|, ~weak$$choice2~0=~weak$$choice2~0_In-1900496736, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1900496736, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1900496736} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 22:57:56,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L828-->L829: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~y$r_buff0_thd0~0_63 v_~y$r_buff0_thd0~0_62)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_25, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 22:57:56,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L831-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_10) (not (= 0 (mod v_~y$flush_delayed~0_11 256))) (= v_~y~0_22 v_~y$mem_tmp~0_6) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:57:56,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 22:57:56,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:57:56 BasicIcfg [2019-12-27 22:57:56,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:57:56,190 INFO L168 Benchmark]: Toolchain (without parser) took 21708.21 ms. Allocated memory was 137.9 MB in the beginning and 955.3 MB in the end (delta: 817.4 MB). Free memory was 100.7 MB in the beginning and 321.7 MB in the end (delta: -221.0 MB). Peak memory consumption was 596.4 MB. Max. memory is 7.1 GB. [2019-12-27 22:57:56,191 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 22:57:56,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.11 ms. Allocated memory was 137.9 MB in the beginning and 200.3 MB in the end (delta: 62.4 MB). Free memory was 100.5 MB in the beginning and 152.0 MB in the end (delta: -51.4 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-12-27 22:57:56,192 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.57 ms. Allocated memory is still 200.3 MB. Free memory was 152.0 MB in the beginning and 149.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:57:56,193 INFO L168 Benchmark]: Boogie Preprocessor took 39.70 ms. Allocated memory is still 200.3 MB. Free memory was 149.3 MB in the beginning and 146.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:57:56,193 INFO L168 Benchmark]: RCFGBuilder took 832.13 ms. Allocated memory is still 200.3 MB. Free memory was 146.6 MB in the beginning and 100.2 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2019-12-27 22:57:56,194 INFO L168 Benchmark]: TraceAbstraction took 19942.49 ms. Allocated memory was 200.3 MB in the beginning and 955.3 MB in the end (delta: 755.0 MB). Free memory was 100.2 MB in the beginning and 321.7 MB in the end (delta: -221.5 MB). Peak memory consumption was 533.4 MB. Max. memory is 7.1 GB. [2019-12-27 22:57:56,198 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.27 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 810.11 ms. Allocated memory was 137.9 MB in the beginning and 200.3 MB in the end (delta: 62.4 MB). Free memory was 100.5 MB in the beginning and 152.0 MB in the end (delta: -51.4 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.57 ms. Allocated memory is still 200.3 MB. Free memory was 152.0 MB in the beginning and 149.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.70 ms. Allocated memory is still 200.3 MB. Free memory was 149.3 MB in the beginning and 146.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 832.13 ms. Allocated memory is still 200.3 MB. Free memory was 146.6 MB in the beginning and 100.2 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19942.49 ms. Allocated memory was 200.3 MB in the beginning and 955.3 MB in the end (delta: 755.0 MB). Free memory was 100.2 MB in the beginning and 321.7 MB in the end (delta: -221.5 MB). Peak memory consumption was 533.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 93 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 25 ChoiceCompositions, 4072 VarBasedMoverChecksPositive, 154 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50143 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L769] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L770] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L771] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L772] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L773] 3 y$r_buff0_thd3 = (_Bool)1 [L776] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 2 x = 1 [L747] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L779] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L780] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L750] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L751] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L753] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L812] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L813] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L814] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L815] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L816] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L819] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 0 y$flush_delayed = weak$$choice2 [L822] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L826] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L827] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L829] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1583 SDtfs, 2305 SDslu, 5072 SDs, 0 SdLazy, 3559 SolverSat, 267 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 55 SyntacticMatches, 23 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22934occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 5761 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 688 NumberOfCodeBlocks, 688 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 616 ConstructedInterpolants, 0 QuantifiedInterpolants, 112749 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...