/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix002_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:57:12,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:57:12,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:57:12,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:57:12,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:57:12,181 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:57:12,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:57:12,189 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:57:12,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:57:12,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:57:12,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:57:12,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:57:12,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:57:12,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:57:12,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:57:12,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:57:12,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:57:12,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:57:12,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:57:12,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:57:12,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:57:12,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:57:12,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:57:12,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:57:12,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:57:12,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:57:12,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:57:12,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:57:12,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:57:12,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:57:12,249 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:57:12,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:57:12,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:57:12,251 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:57:12,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:57:12,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:57:12,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:57:12,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:57:12,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:57:12,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:57:12,257 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:57:12,258 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-21 23:57:12,299 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:57:12,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:57:12,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:57:12,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:57:12,302 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:57:12,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:57:12,303 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:57:12,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:57:12,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:57:12,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:57:12,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:57:12,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:57:12,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:57:12,304 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:57:12,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:57:12,304 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:57:12,304 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:57:12,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:57:12,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:57:12,309 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:57:12,309 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:57:12,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:57:12,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:57:12,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:57:12,310 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:57:12,311 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:57:12,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:57:12,311 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-21 23:57:12,311 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:57:12,312 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:57:12,312 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-21 23:57:12,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:57:12,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:57:12,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:57:12,678 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:57:12,678 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:57:12,679 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002_power.opt.i [2020-10-21 23:57:12,752 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f9922c37/fc3fc63c1aa747df8487ee285f37dbdd/FLAGbf84231b6 [2020-10-21 23:57:13,299 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:57:13,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002_power.opt.i [2020-10-21 23:57:13,321 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f9922c37/fc3fc63c1aa747df8487ee285f37dbdd/FLAGbf84231b6 [2020-10-21 23:57:13,584 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f9922c37/fc3fc63c1aa747df8487ee285f37dbdd [2020-10-21 23:57:13,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:57:13,600 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:57:13,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:57:13,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:57:13,605 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:57:13,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:57:13" (1/1) ... [2020-10-21 23:57:13,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2010bc51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:13, skipping insertion in model container [2020-10-21 23:57:13,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:57:13" (1/1) ... [2020-10-21 23:57:13,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:57:13,667 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:57:14,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:57:14,218 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:57:14,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:57:14,423 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:57:14,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:14 WrapperNode [2020-10-21 23:57:14,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:57:14,425 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:57:14,425 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:57:14,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:57:14,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:14" (1/1) ... [2020-10-21 23:57:14,459 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:14" (1/1) ... [2020-10-21 23:57:14,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:57:14,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:57:14,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:57:14,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:57:14,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:14" (1/1) ... [2020-10-21 23:57:14,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:14" (1/1) ... [2020-10-21 23:57:14,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:14" (1/1) ... [2020-10-21 23:57:14,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:14" (1/1) ... [2020-10-21 23:57:14,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:14" (1/1) ... [2020-10-21 23:57:14,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:14" (1/1) ... [2020-10-21 23:57:14,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:14" (1/1) ... [2020-10-21 23:57:14,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:57:14,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:57:14,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:57:14,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:57:14,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:14" (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 [2020-10-21 23:57:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:57:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:57:14,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:57:14,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:57:14,616 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 23:57:14,616 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 23:57:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 23:57:14,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 23:57:14,618 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 23:57:14,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 23:57:14,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:57:14,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:57:14,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:57:14,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:57:14,624 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 23:57:17,116 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:57:17,116 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 23:57:17,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:57:17 BoogieIcfgContainer [2020-10-21 23:57:17,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:57:17,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:57:17,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:57:17,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:57:17,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:57:13" (1/3) ... [2020-10-21 23:57:17,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59019491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:57:17, skipping insertion in model container [2020-10-21 23:57:17,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:14" (2/3) ... [2020-10-21 23:57:17,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59019491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:57:17, skipping insertion in model container [2020-10-21 23:57:17,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:57:17" (3/3) ... [2020-10-21 23:57:17,128 INFO L111 eAbstractionObserver]: Analyzing ICFG mix002_power.opt.i [2020-10-21 23:57:17,140 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:57:17,140 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:57:17,149 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 23:57:17,150 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:57:17,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,227 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,227 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,228 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,228 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,239 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,239 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,240 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,241 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,251 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,275 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,275 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,280 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,282 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,284 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,286 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,287 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:17,292 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 23:57:17,308 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-21 23:57:17,333 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:57:17,333 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:57:17,333 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:57:17,333 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-21 23:57:17,333 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:57:17,333 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:57:17,333 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:57:17,334 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:57:17,354 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:57:17,355 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 109 transitions, 233 flow [2020-10-21 23:57:17,358 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 109 transitions, 233 flow [2020-10-21 23:57:17,361 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 116 places, 109 transitions, 233 flow [2020-10-21 23:57:17,441 INFO L129 PetriNetUnfolder]: 3/106 cut-off events. [2020-10-21 23:57:17,441 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 23:57:17,449 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 3/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2020-10-21 23:57:17,455 INFO L116 LiptonReduction]: Number of co-enabled transitions 2054 [2020-10-21 23:57:18,166 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-21 23:57:18,392 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-21 23:57:20,480 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-10-21 23:57:20,671 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-10-21 23:57:21,130 WARN L193 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 124 [2020-10-21 23:57:21,337 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-21 23:57:21,343 INFO L131 LiptonReduction]: Checked pairs total: 5659 [2020-10-21 23:57:21,344 INFO L133 LiptonReduction]: Total number of compositions: 99 [2020-10-21 23:57:21,349 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-10-21 23:57:21,412 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 937 states. [2020-10-21 23:57:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states. [2020-10-21 23:57:21,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-21 23:57:21,421 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:57:21,422 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:57:21,423 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:57:21,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:57:21,429 INFO L82 PathProgramCache]: Analyzing trace with hash 2072543382, now seen corresponding path program 1 times [2020-10-21 23:57:21,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:57:21,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076521830] [2020-10-21 23:57:21,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:57:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:57:21,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:57:21,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076521830] [2020-10-21 23:57:21,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:57:21,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:57:21,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [679304081] [2020-10-21 23:57:21,703 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:57:21,705 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:57:21,720 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-21 23:57:21,720 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:57:21,725 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-21 23:57:21,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:57:21,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:57:21,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:57:21,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:57:21,743 INFO L87 Difference]: Start difference. First operand 937 states. Second operand 3 states. [2020-10-21 23:57:21,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:57:21,825 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-10-21 23:57:21,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:57:21,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-21 23:57:21,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:57:21,850 INFO L225 Difference]: With dead ends: 812 [2020-10-21 23:57:21,850 INFO L226 Difference]: Without dead ends: 662 [2020-10-21 23:57:21,852 INFO L677 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 [2020-10-21 23:57:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-10-21 23:57:21,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2020-10-21 23:57:21,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2020-10-21 23:57:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2060 transitions. [2020-10-21 23:57:21,947 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 2060 transitions. Word has length 7 [2020-10-21 23:57:21,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:57:21,948 INFO L481 AbstractCegarLoop]: Abstraction has 662 states and 2060 transitions. [2020-10-21 23:57:21,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:57:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 2060 transitions. [2020-10-21 23:57:21,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 23:57:21,950 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:57:21,950 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:57:21,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:57:21,951 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:57:21,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:57:21,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1150539865, now seen corresponding path program 1 times [2020-10-21 23:57:21,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:57:21,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58993794] [2020-10-21 23:57:21,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:57:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:57:22,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:57:22,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58993794] [2020-10-21 23:57:22,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:57:22,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:57:22,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2085746378] [2020-10-21 23:57:22,096 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:57:22,097 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:57:22,098 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-21 23:57:22,098 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:57:22,099 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-21 23:57:22,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:57:22,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:57:22,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:57:22,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:57:22,101 INFO L87 Difference]: Start difference. First operand 662 states and 2060 transitions. Second operand 3 states. [2020-10-21 23:57:22,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:57:22,121 INFO L93 Difference]: Finished difference Result 612 states and 1880 transitions. [2020-10-21 23:57:22,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:57:22,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 23:57:22,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:57:22,127 INFO L225 Difference]: With dead ends: 612 [2020-10-21 23:57:22,127 INFO L226 Difference]: Without dead ends: 612 [2020-10-21 23:57:22,128 INFO L677 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 [2020-10-21 23:57:22,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-10-21 23:57:22,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2020-10-21 23:57:22,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2020-10-21 23:57:22,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1880 transitions. [2020-10-21 23:57:22,152 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1880 transitions. Word has length 9 [2020-10-21 23:57:22,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:57:22,152 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 1880 transitions. [2020-10-21 23:57:22,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:57:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1880 transitions. [2020-10-21 23:57:22,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 23:57:22,154 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:57:22,155 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:57:22,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:57:22,155 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:57:22,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:57:22,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1862258696, now seen corresponding path program 1 times [2020-10-21 23:57:22,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:57:22,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008830135] [2020-10-21 23:57:22,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:57:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:57:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:57:22,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008830135] [2020-10-21 23:57:22,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:57:22,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:57:22,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [949769015] [2020-10-21 23:57:22,240 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:57:22,242 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:57:22,245 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-21 23:57:22,246 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:57:22,246 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-21 23:57:22,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:57:22,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:57:22,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:57:22,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:57:22,247 INFO L87 Difference]: Start difference. First operand 612 states and 1880 transitions. Second operand 3 states. [2020-10-21 23:57:22,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:57:22,259 INFO L93 Difference]: Finished difference Result 572 states and 1738 transitions. [2020-10-21 23:57:22,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:57:22,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-21 23:57:22,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:57:22,264 INFO L225 Difference]: With dead ends: 572 [2020-10-21 23:57:22,265 INFO L226 Difference]: Without dead ends: 572 [2020-10-21 23:57:22,265 INFO L677 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 [2020-10-21 23:57:22,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-10-21 23:57:22,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2020-10-21 23:57:22,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2020-10-21 23:57:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1738 transitions. [2020-10-21 23:57:22,284 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 1738 transitions. Word has length 11 [2020-10-21 23:57:22,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:57:22,284 INFO L481 AbstractCegarLoop]: Abstraction has 572 states and 1738 transitions. [2020-10-21 23:57:22,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:57:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 1738 transitions. [2020-10-21 23:57:22,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:57:22,288 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:57:22,288 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:57:22,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:57:22,288 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:57:22,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:57:22,289 INFO L82 PathProgramCache]: Analyzing trace with hash -39133544, now seen corresponding path program 1 times [2020-10-21 23:57:22,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:57:22,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667424163] [2020-10-21 23:57:22,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:57:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:57:22,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:57:22,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667424163] [2020-10-21 23:57:22,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:57:22,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:57:22,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2030246774] [2020-10-21 23:57:22,396 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:57:22,399 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:57:22,407 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 37 transitions. [2020-10-21 23:57:22,407 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:57:23,329 WARN L193 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 3 [2020-10-21 23:57:23,505 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-21 23:57:23,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:57:23,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:57:23,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:57:23,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:57:23,509 INFO L87 Difference]: Start difference. First operand 572 states and 1738 transitions. Second operand 3 states. [2020-10-21 23:57:23,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:57:23,529 INFO L93 Difference]: Finished difference Result 548 states and 1656 transitions. [2020-10-21 23:57:23,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:57:23,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-21 23:57:23,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:57:23,534 INFO L225 Difference]: With dead ends: 548 [2020-10-21 23:57:23,534 INFO L226 Difference]: Without dead ends: 548 [2020-10-21 23:57:23,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:57:23,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-10-21 23:57:23,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2020-10-21 23:57:23,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2020-10-21 23:57:23,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1656 transitions. [2020-10-21 23:57:23,562 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1656 transitions. Word has length 13 [2020-10-21 23:57:23,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:57:23,562 INFO L481 AbstractCegarLoop]: Abstraction has 548 states and 1656 transitions. [2020-10-21 23:57:23,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:57:23,563 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1656 transitions. [2020-10-21 23:57:23,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:57:23,567 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:57:23,567 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:57:23,568 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:57:23,568 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:57:23,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:57:23,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1047375884, now seen corresponding path program 1 times [2020-10-21 23:57:23,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:57:23,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97338463] [2020-10-21 23:57:23,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:57:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:57:23,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:57:23,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97338463] [2020-10-21 23:57:23,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:57:23,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:57:23,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [392416942] [2020-10-21 23:57:23,778 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:57:23,783 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:57:23,814 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 151 transitions. [2020-10-21 23:57:23,815 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:57:24,142 WARN L193 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 1 [2020-10-21 23:57:24,206 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:24,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:24,411 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:24,500 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:24,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:24,762 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:24,973 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9341#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-21 23:57:24,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:57:24,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:57:24,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:57:24,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:57:24,975 INFO L87 Difference]: Start difference. First operand 548 states and 1656 transitions. Second operand 5 states. [2020-10-21 23:57:25,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:57:25,054 INFO L93 Difference]: Finished difference Result 398 states and 1085 transitions. [2020-10-21 23:57:25,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:57:25,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-21 23:57:25,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:57:25,057 INFO L225 Difference]: With dead ends: 398 [2020-10-21 23:57:25,057 INFO L226 Difference]: Without dead ends: 248 [2020-10-21 23:57:25,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:57:25,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-10-21 23:57:25,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2020-10-21 23:57:25,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-10-21 23:57:25,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 584 transitions. [2020-10-21 23:57:25,065 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 584 transitions. Word has length 15 [2020-10-21 23:57:25,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:57:25,065 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 584 transitions. [2020-10-21 23:57:25,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:57:25,066 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 584 transitions. [2020-10-21 23:57:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-21 23:57:25,067 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:57:25,067 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:57:25,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:57:25,067 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:57:25,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:57:25,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1693294392, now seen corresponding path program 1 times [2020-10-21 23:57:25,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:57:25,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104212033] [2020-10-21 23:57:25,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:57:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:57:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:57:25,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104212033] [2020-10-21 23:57:25,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:57:25,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:57:25,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [612869907] [2020-10-21 23:57:25,157 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:57:25,162 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:57:25,242 INFO L252 McrAutomatonBuilder]: Finished intersection with 91 states and 189 transitions. [2020-10-21 23:57:25,242 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:57:25,648 WARN L193 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 3 [2020-10-21 23:57:26,267 WARN L193 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 3 [2020-10-21 23:57:27,195 WARN L193 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-21 23:57:27,401 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 3 [2020-10-21 23:57:27,910 WARN L193 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-21 23:57:28,362 WARN L193 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 3 [2020-10-21 23:57:28,948 WARN L193 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 3 [2020-10-21 23:57:29,389 WARN L193 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-21 23:57:30,312 WARN L193 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-21 23:57:30,881 WARN L193 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-21 23:57:31,536 WARN L193 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 3 [2020-10-21 23:57:32,681 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-21 23:57:32,902 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-21 23:57:32,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:57:32,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:57:32,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:57:32,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:57:32,904 INFO L87 Difference]: Start difference. First operand 248 states and 584 transitions. Second operand 4 states. [2020-10-21 23:57:32,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:57:32,937 INFO L93 Difference]: Finished difference Result 334 states and 759 transitions. [2020-10-21 23:57:32,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:57:32,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-21 23:57:32,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:57:32,941 INFO L225 Difference]: With dead ends: 334 [2020-10-21 23:57:32,941 INFO L226 Difference]: Without dead ends: 250 [2020-10-21 23:57:32,941 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:57:32,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-10-21 23:57:32,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2020-10-21 23:57:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-10-21 23:57:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 550 transitions. [2020-10-21 23:57:32,954 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 550 transitions. Word has length 19 [2020-10-21 23:57:32,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:57:32,955 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 550 transitions. [2020-10-21 23:57:32,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:57:32,955 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 550 transitions. [2020-10-21 23:57:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-21 23:57:32,957 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:57:32,957 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:57:32,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:57:32,958 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:57:32,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:57:32,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1770466504, now seen corresponding path program 2 times [2020-10-21 23:57:32,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:57:32,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620126707] [2020-10-21 23:57:32,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:57:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:57:33,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:57:33,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620126707] [2020-10-21 23:57:33,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:57:33,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:57:33,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1578120946] [2020-10-21 23:57:33,195 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:57:33,200 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:57:33,226 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 113 transitions. [2020-10-21 23:57:33,226 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:57:33,527 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 3 [2020-10-21 23:57:34,075 WARN L193 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-21 23:57:34,602 WARN L193 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-21 23:57:35,092 WARN L193 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-21 23:57:35,598 WARN L193 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 3 [2020-10-21 23:57:36,076 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [11083#(<= ~__unbuffered_cnt~0 0)] [2020-10-21 23:57:36,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:57:36,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:57:36,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:57:36,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:57:36,077 INFO L87 Difference]: Start difference. First operand 248 states and 550 transitions. Second operand 7 states. [2020-10-21 23:57:36,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:57:36,155 INFO L93 Difference]: Finished difference Result 229 states and 511 transitions. [2020-10-21 23:57:36,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:57:36,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-21 23:57:36,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:57:36,157 INFO L225 Difference]: With dead ends: 229 [2020-10-21 23:57:36,157 INFO L226 Difference]: Without dead ends: 119 [2020-10-21 23:57:36,157 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:57:36,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-10-21 23:57:36,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2020-10-21 23:57:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-21 23:57:36,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 242 transitions. [2020-10-21 23:57:36,162 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 242 transitions. Word has length 19 [2020-10-21 23:57:36,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:57:36,162 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 242 transitions. [2020-10-21 23:57:36,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:57:36,163 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 242 transitions. [2020-10-21 23:57:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:57:36,163 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:57:36,164 INFO L422 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] [2020-10-21 23:57:36,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:57:36,164 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:57:36,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:57:36,164 INFO L82 PathProgramCache]: Analyzing trace with hash -535948347, now seen corresponding path program 1 times [2020-10-21 23:57:36,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:57:36,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616462080] [2020-10-21 23:57:36,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:57:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:57:36,505 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-10-21 23:57:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:57:36,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616462080] [2020-10-21 23:57:36,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:57:36,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:57:36,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1576506090] [2020-10-21 23:57:36,588 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:57:36,595 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:57:36,611 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 50 transitions. [2020-10-21 23:57:36,611 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:57:36,763 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 20 [2020-10-21 23:57:37,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:37,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:37,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:37,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:37,029 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:37,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:37,031 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:37,034 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:37,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:37,041 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-21 23:57:37,041 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:37,043 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-21 23:57:37,043 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:37,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:37,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:37,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,053 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,057 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,060 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,064 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:37,065 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,073 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,074 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,081 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:37,082 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:37,082 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:57:37,088 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,089 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,094 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,098 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:37,099 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,100 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,107 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,112 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,118 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:37,119 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:57:37,125 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,128 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,131 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,135 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:37,136 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,137 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,143 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:37,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:37,159 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 2, 4, 2, 3, 2, 1] term [2020-10-21 23:57:37,159 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:37,839 WARN L193 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 45 [2020-10-21 23:57:38,110 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 102 [2020-10-21 23:57:38,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:38,124 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,124 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,131 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:38,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:38,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,133 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,136 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-21 23:57:38,137 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,139 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-21 23:57:38,139 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,141 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,141 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,143 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,149 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-21 23:57:38,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,157 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:57:38,164 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:38,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:57:38,172 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:38,178 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,179 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:57:38,182 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,198 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:57:38,204 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,216 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,221 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,222 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:57:38,226 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,231 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,235 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,236 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:57:38,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:38,238 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,238 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,244 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:38,254 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,255 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,262 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,263 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,264 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:57:38,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,273 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,280 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-21 23:57:38,281 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:57:38,306 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 2, 4, 2, 3, 2, 1] term [2020-10-21 23:57:38,307 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,498 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 41 [2020-10-21 23:57:38,661 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 102 [2020-10-21 23:57:38,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:38,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:38,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:38,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:38,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:38,676 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,677 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,681 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,685 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-21 23:57:38,686 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,687 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-21 23:57:38,687 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,688 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,688 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:38,689 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:38,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,691 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:57:38,695 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:38,696 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,699 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,704 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,704 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:38,711 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:57:38,722 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:38,723 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,730 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,734 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,734 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:38,742 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,747 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-10-21 23:57:38,747 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:38,748 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,752 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:38,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,758 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:57:38,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,760 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:38,765 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:38,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:38,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,787 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,788 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:38,794 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:38,797 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,808 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:38,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,813 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:57:38,813 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:57:38,818 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,819 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:38,825 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:38,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,836 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:38,843 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:38,847 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,856 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:38,861 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,862 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-21 23:57:38,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,866 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,869 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,870 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:38,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,874 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:38,881 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,882 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,889 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:38,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,893 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,898 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:38,899 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:38,905 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 2, 4, 2, 3, 2, 1] term [2020-10-21 23:57:38,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,370 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 102 [2020-10-21 23:57:39,379 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:39,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:39,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:39,381 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,383 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:39,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:39,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,390 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,394 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-21 23:57:39,395 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,397 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-21 23:57:39,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,398 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,399 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:57:39,400 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,406 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:57:39,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,415 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:39,416 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:39,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:39,426 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:39,433 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:57:39,433 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,441 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:39,442 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:39,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:39,451 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:39,458 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,459 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,467 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:39,468 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:39,469 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:39,478 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:39,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,486 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,487 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:57:39,487 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,494 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:57:39,501 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:39,502 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:39,511 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:39,512 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:39,518 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:57:39,520 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:39,520 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:39,524 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:39,538 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:57:39,545 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:39,546 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:39,547 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:39,555 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:39,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,567 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:57:39,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,569 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:39,578 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,581 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:39,582 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:39,585 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:57:39,598 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:57:39,603 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:39,608 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:57:39,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:39,618 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:39,629 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 2, 4, 2, 3, 2, 1] term [2020-10-21 23:57:39,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:57:39,711 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [11560#(and (or (= (mod ~z$w_buff0_used~0 256) 0) (not (= ~__unbuffered_p2_EAX~0 1)) (= (mod ~z$r_buff0_thd3~0 256) 0) (= ~z$w_buff0~0 ~__unbuffered_p2_EAX~0)) (or (and (or (= (mod ~z$w_buff1_used~0 256) 0) (and (= ~z$r_buff1_thd2~0 0) (not (= ~__unbuffered_p2_EAX~0 1)))) (or (= ~z$r_buff1_thd2~0 0) (and (= ~z~0 1) (= ~z$w_buff0_used~0 0))) (or (not (= ~__unbuffered_p2_EAX~0 1)) (and (= ~z~0 ~__unbuffered_p2_EAX~0) (or (not (= ~z$w_buff0~0 0)) (and (= ~z~0 1) (= ~z$w_buff0_used~0 0)))))) (and (not (= (mod ~z$r_buff0_thd3~0 256) 0)) (not (= (mod ~z$w_buff0_used~0 256) 0)))) (or (= ~z$r_buff1_thd2~0 0) (= (mod ~z$w_buff0_used~0 256) 0) (= ~z$w_buff0~0 1)))] [2020-10-21 23:57:39,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:57:39,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:57:39,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:57:39,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:57:39,713 INFO L87 Difference]: Start difference. First operand 119 states and 242 transitions. Second operand 8 states. [2020-10-21 23:57:40,189 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2020-10-21 23:57:40,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:57:40,301 INFO L93 Difference]: Finished difference Result 150 states and 294 transitions. [2020-10-21 23:57:40,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:57:40,303 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-21 23:57:40,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:57:40,304 INFO L225 Difference]: With dead ends: 150 [2020-10-21 23:57:40,304 INFO L226 Difference]: Without dead ends: 122 [2020-10-21 23:57:40,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:57:40,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-10-21 23:57:40,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2020-10-21 23:57:40,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-21 23:57:40,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 200 transitions. [2020-10-21 23:57:40,311 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 200 transitions. Word has length 22 [2020-10-21 23:57:40,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:57:40,311 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 200 transitions. [2020-10-21 23:57:40,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:57:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 200 transitions. [2020-10-21 23:57:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:57:40,313 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:57:40,313 INFO L422 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] [2020-10-21 23:57:40,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:57:40,314 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:57:40,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:57:40,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1092764101, now seen corresponding path program 2 times [2020-10-21 23:57:40,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:57:40,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888592547] [2020-10-21 23:57:40,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:57:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:57:40,379 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:57:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:57:40,441 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:57:40,491 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:57:40,491 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:57:40,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:57:40,493 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 23:57:40,524 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1208] [1208] L2-->L874: Formula: (let ((.cse6 (= (mod ~z$w_buff0_used~0_In-1957338876 256) 0)) (.cse7 (= (mod ~z$r_buff0_thd0~0_In-1957338876 256) 0)) (.cse9 (= (mod ~z$r_buff1_thd0~0_In-1957338876 256) 0)) (.cse8 (= (mod ~z$w_buff1_used~0_In-1957338876 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse5 (or .cse6 .cse7)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (= ~z$r_buff0_thd0~0_In-1957338876 ~z$r_buff0_thd0~0_Out-1957338876) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1957338876 0)) (or (and (= ~z$w_buff1_used~0_In-1957338876 ~z$w_buff1_used~0_Out-1957338876) .cse0) (and .cse1 (= ~z$w_buff1_used~0_Out-1957338876 0) .cse2)) (or (and .cse3 (= ~z~0_Out-1957338876 ~z$w_buff0~0_In-1957338876) .cse4) (and .cse5 (or (and .cse1 .cse2 (= ~z~0_Out-1957338876 ~z$w_buff1~0_In-1957338876)) (and .cse0 (= ~z~0_Out-1957338876 ~z~0_In-1957338876))))) (or (and .cse5 (= ~z$w_buff0_used~0_Out-1957338876 ~z$w_buff0_used~0_In-1957338876)) (and .cse3 (= ~z$w_buff0_used~0_Out-1957338876 0) .cse4)) (= ~z$r_buff1_thd0~0_Out-1957338876 ~z$r_buff1_thd0~0_In-1957338876) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1957338876 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1957338876|)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1957338876|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1957338876, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1957338876, ~z$w_buff0~0=~z$w_buff0~0_In-1957338876, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1957338876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1957338876, ~z$w_buff1~0=~z$w_buff1~0_In-1957338876, ~z~0=~z~0_In-1957338876} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1957338876, ~z$w_buff0~0=~z$w_buff0~0_In-1957338876, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1957338876, ~z$w_buff1~0=~z$w_buff1~0_In-1957338876, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-1957338876|, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-1957338876|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1957338876|, ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1957338876|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1957338876|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-1957338876, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1957338876|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1957338876|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1957338876, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1957338876, ~z~0=~z~0_Out-1957338876} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite63, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2020-10-21 23:57:40,532 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,532 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,533 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,533 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [804] [2020-10-21 23:57:40,534 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,534 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,535 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,535 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,535 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,535 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,535 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,536 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,536 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,537 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,537 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,537 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,537 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,537 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,539 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,539 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,540 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,540 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,540 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,540 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,540 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,540 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,541 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,541 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,541 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,541 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,541 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,541 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,542 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,542 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,542 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,542 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,542 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,543 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,543 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,543 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,543 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,543 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,544 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,544 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,544 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,544 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,545 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,545 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,545 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,545 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,545 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,545 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,546 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:57:40,546 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:57:40,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:57:40 BasicIcfg [2020-10-21 23:57:40,625 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:57:40,627 INFO L168 Benchmark]: Toolchain (without parser) took 27032.05 ms. Allocated memory was 141.0 MB in the beginning and 415.8 MB in the end (delta: 274.7 MB). Free memory was 102.1 MB in the beginning and 195.0 MB in the end (delta: -92.9 MB). Peak memory consumption was 181.9 MB. Max. memory is 7.1 GB. [2020-10-21 23:57:40,628 INFO L168 Benchmark]: CDTParser took 2.65 ms. Allocated memory is still 141.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-21 23:57:40,629 INFO L168 Benchmark]: CACSL2BoogieTranslator took 823.40 ms. Allocated memory was 141.0 MB in the beginning and 206.6 MB in the end (delta: 65.5 MB). Free memory was 101.1 MB in the beginning and 157.8 MB in the end (delta: -56.7 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2020-10-21 23:57:40,630 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.92 ms. Allocated memory is still 206.6 MB. Free memory was 157.8 MB in the beginning and 154.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-21 23:57:40,631 INFO L168 Benchmark]: Boogie Preprocessor took 44.95 ms. Allocated memory is still 206.6 MB. Free memory was 154.5 MB in the beginning and 151.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-21 23:57:40,631 INFO L168 Benchmark]: RCFGBuilder took 2577.17 ms. Allocated memory was 206.6 MB in the beginning and 244.8 MB in the end (delta: 38.3 MB). Free memory was 151.9 MB in the beginning and 98.7 MB in the end (delta: 53.1 MB). Peak memory consumption was 93.3 MB. Max. memory is 7.1 GB. [2020-10-21 23:57:40,632 INFO L168 Benchmark]: TraceAbstraction took 23505.12 ms. Allocated memory was 244.8 MB in the beginning and 415.8 MB in the end (delta: 170.9 MB). Free memory was 98.7 MB in the beginning and 195.0 MB in the end (delta: -96.2 MB). Peak memory consumption was 74.7 MB. Max. memory is 7.1 GB. [2020-10-21 23:57:40,637 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.65 ms. Allocated memory is still 141.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 823.40 ms. Allocated memory was 141.0 MB in the beginning and 206.6 MB in the end (delta: 65.5 MB). Free memory was 101.1 MB in the beginning and 157.8 MB in the end (delta: -56.7 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.92 ms. Allocated memory is still 206.6 MB. Free memory was 157.8 MB in the beginning and 154.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.95 ms. Allocated memory is still 206.6 MB. Free memory was 154.5 MB in the beginning and 151.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2577.17 ms. Allocated memory was 206.6 MB in the beginning and 244.8 MB in the end (delta: 38.3 MB). Free memory was 151.9 MB in the beginning and 98.7 MB in the end (delta: 53.1 MB). Peak memory consumption was 93.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23505.12 ms. Allocated memory was 244.8 MB in the beginning and 415.8 MB in the end (delta: 170.9 MB). Free memory was 98.7 MB in the beginning and 195.0 MB in the end (delta: -96.2 MB). Peak memory consumption was 74.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1181 VarBasedMoverChecksPositive, 35 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 101 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.9s, 116 PlacesBefore, 37 PlacesAfterwards, 109 TransitionsBefore, 28 TransitionsAfterwards, 2054 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 99 TotalNumberOfCompositions, 5659 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool main$tmp_guard0; [L725] 0 _Bool main$tmp_guard1; [L727] 0 int x = 0; [L729] 0 int y = 0; [L731] 0 int z = 0; [L732] 0 _Bool z$flush_delayed; [L733] 0 int z$mem_tmp; [L734] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd1; [L736] 0 _Bool z$r_buff0_thd2; [L737] 0 _Bool z$r_buff0_thd3; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$read_delayed; [L743] 0 int *z$read_delayed_var; [L744] 0 int z$w_buff0; [L745] 0 _Bool z$w_buff0_used; [L746] 0 int z$w_buff1; [L747] 0 _Bool z$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L858] 0 pthread_t t41; [L859] FCALL, FORK 0 pthread_create(&t41, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t42; [L861] FCALL, FORK 0 pthread_create(&t42, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 pthread_t t43; [L863] FCALL, FORK 0 pthread_create(&t43, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 z$w_buff1 = z$w_buff0 [L806] 3 z$w_buff0 = 1 [L807] 3 z$w_buff1_used = z$w_buff0_used [L808] 3 z$w_buff0_used = (_Bool)1 [L18] COND TRUE 3 !expression [L17] COND FALSE 3 !(0) [L17] 3 __assert_fail ("0", "mix002_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L810] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L811] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L812] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L813] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L814] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 z$flush_delayed = weak$$choice2 [L820] 3 z$mem_tmp = z [L821] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L821] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 [L821] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L821] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L822] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L822] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L822] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L822] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L823] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L823] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L824] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L824] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L825] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L826] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L827] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EAX = z [L829] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L829] 3 z = z$flush_delayed ? z$mem_tmp : z [L830] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 a = 1 [L756] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L774] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L781] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L782] 2 z$flush_delayed = weak$$choice2 [L783] 2 z$mem_tmp = z [L784] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L784] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L785] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L785] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0) [L785] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0 [L785] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0) [L785] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L785] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L786] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L786] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L787] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L787] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used) [L787] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L787] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L788] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L789] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2) [L789] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L789] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L790] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 __unbuffered_p1_EBX = z [L792] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L792] 2 z = z$flush_delayed ? z$mem_tmp : z [L793] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L836] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L836] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L836] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L836] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L837] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L837] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L838] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L838] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L839] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L839] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L840] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L843] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 3 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L876] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix002_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 107 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23.1s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 208 SDtfs, 198 SDslu, 351 SDs, 0 SdLazy, 131 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 224 GetRequests, 185 SyntacticMatches, 12 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=937occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 23 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 13053 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...