/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/mix007_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:49:37,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:49:37,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:49:37,329 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:49:37,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:49:37,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:49:37,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:49:37,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:49:37,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:49:37,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:49:37,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:49:37,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:49:37,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:49:37,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:49:37,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:49:37,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:49:37,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:49:37,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:49:37,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:49:37,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:49:37,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:49:37,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:49:37,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:49:37,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:49:37,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:49:37,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:49:37,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:49:37,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:49:37,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:49:37,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:49:37,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:49:37,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:49:37,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:49:37,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:49:37,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:49:37,364 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:49:37,365 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:49:37,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:49:37,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:49:37,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:49:37,367 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:49:37,368 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-16 12:49:37,393 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:49:37,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:49:37,394 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:49:37,394 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:49:37,395 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:49:37,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:49:37,395 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:49:37,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:49:37,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:49:37,396 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:49:37,396 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:49:37,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:49:37,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:49:37,397 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:49:37,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:49:37,397 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:49:37,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:49:37,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:49:37,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:49:37,398 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:49:37,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:49:37,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:49:37,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:49:37,399 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:49:37,399 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:49:37,399 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:49:37,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:49:37,399 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-16 12:49:37,400 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:49:37,400 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:49:37,400 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-16 12:49:37,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:49:37,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:49:37,703 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:49:37,705 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:49:37,708 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:49:37,709 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix007_pso.opt.i [2020-10-16 12:49:37,780 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/dc56e6b9e/e050d7a9fe2649c1ab2a5a86aafb2edc/FLAG8e68c26d1 [2020-10-16 12:49:38,346 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:49:38,347 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix007_pso.opt.i [2020-10-16 12:49:38,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/dc56e6b9e/e050d7a9fe2649c1ab2a5a86aafb2edc/FLAG8e68c26d1 [2020-10-16 12:49:38,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/dc56e6b9e/e050d7a9fe2649c1ab2a5a86aafb2edc [2020-10-16 12:49:38,639 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:49:38,641 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:49:38,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:49:38,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:49:38,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:49:38,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:49:38" (1/1) ... [2020-10-16 12:49:38,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b05ae09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:38, skipping insertion in model container [2020-10-16 12:49:38,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:49:38" (1/1) ... [2020-10-16 12:49:38,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:49:38,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:49:39,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:49:39,234 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:49:39,376 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:49:39,452 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:49:39,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:39 WrapperNode [2020-10-16 12:49:39,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:49:39,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:49:39,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:49:39,454 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:49:39,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:39" (1/1) ... [2020-10-16 12:49:39,485 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:39" (1/1) ... [2020-10-16 12:49:39,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:49:39,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:49:39,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:49:39,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:49:39,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:39" (1/1) ... [2020-10-16 12:49:39,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:39" (1/1) ... [2020-10-16 12:49:39,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:39" (1/1) ... [2020-10-16 12:49:39,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:39" (1/1) ... [2020-10-16 12:49:39,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:39" (1/1) ... [2020-10-16 12:49:39,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:39" (1/1) ... [2020-10-16 12:49:39,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:39" (1/1) ... [2020-10-16 12:49:39,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:49:39,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:49:39,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:49:39,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:49:39,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:39" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-16 12:49:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:49:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:49:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:49:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:49:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:49:39,667 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:49:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:49:39,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:49:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:49:39,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:49:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 12:49:39,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 12:49:39,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:49:39,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:49:39,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:49:39,672 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:49:42,102 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:49:42,102 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:49:42,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:49:42 BoogieIcfgContainer [2020-10-16 12:49:42,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:49:42,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:49:42,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:49:42,110 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:49:42,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:49:38" (1/3) ... [2020-10-16 12:49:42,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5920bee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:49:42, skipping insertion in model container [2020-10-16 12:49:42,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:39" (2/3) ... [2020-10-16 12:49:42,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5920bee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:49:42, skipping insertion in model container [2020-10-16 12:49:42,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:49:42" (3/3) ... [2020-10-16 12:49:42,114 INFO L111 eAbstractionObserver]: Analyzing ICFG mix007_pso.opt.i [2020-10-16 12:49:42,126 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:49:42,127 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:49:42,135 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:49:42,137 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:49:42,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,175 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,175 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,177 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,177 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,178 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,178 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,182 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,182 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,182 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,182 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,182 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,182 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,187 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,188 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,188 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,188 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,188 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,188 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,189 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,189 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,189 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,189 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,189 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,190 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,190 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,190 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,190 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,190 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,190 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,190 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,191 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,191 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,191 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,191 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,191 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,192 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,192 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,192 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,192 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,192 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,192 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,193 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,193 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,193 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,193 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,193 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,193 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,210 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,211 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,216 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,217 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,217 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,217 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,217 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,217 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,217 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,218 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,218 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,218 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,218 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,218 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,220 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,223 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,224 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,226 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,226 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:49:42,227 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:49:42,241 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 12:49:42,263 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:49:42,263 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:49:42,263 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:49:42,263 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-16 12:49:42,264 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:49:42,264 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:49:42,264 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:49:42,264 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:49:42,279 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:49:42,279 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 244 flow [2020-10-16 12:49:42,282 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 244 flow [2020-10-16 12:49:42,284 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-10-16 12:49:42,338 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-16 12:49:42,339 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:49:42,345 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2020-10-16 12:49:42,350 INFO L117 LiptonReduction]: Number of co-enabled transitions 2446 [2020-10-16 12:49:43,103 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-16 12:49:43,850 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2020-10-16 12:49:44,514 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2020-10-16 12:49:45,011 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-10-16 12:49:45,420 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2020-10-16 12:49:45,572 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-16 12:49:45,584 INFO L132 LiptonReduction]: Checked pairs total: 7121 [2020-10-16 12:49:45,584 INFO L134 LiptonReduction]: Total number of compositions: 92 [2020-10-16 12:49:45,591 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 32 transitions, 84 flow [2020-10-16 12:49:45,792 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3002 states. [2020-10-16 12:49:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states. [2020-10-16 12:49:45,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:49:45,804 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:49:45,805 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:49:45,805 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:49:45,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:49:45,812 INFO L82 PathProgramCache]: Analyzing trace with hash 987745277, now seen corresponding path program 1 times [2020-10-16 12:49:45,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:49:45,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695939216] [2020-10-16 12:49:45,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:49:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:49:46,158 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-16 12:49:46,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695939216] [2020-10-16 12:49:46,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:49:46,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:49:46,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1134725432] [2020-10-16 12:49:46,162 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:49:46,165 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:49:46,184 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-16 12:49:46,185 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:49:46,189 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:49:46,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:49:46,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:49:46,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:49:46,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:49:46,209 INFO L87 Difference]: Start difference. First operand 3002 states. Second operand 3 states. [2020-10-16 12:49:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:49:46,360 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-10-16 12:49:46,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:49:46,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 12:49:46,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:49:46,420 INFO L225 Difference]: With dead ends: 2602 [2020-10-16 12:49:46,420 INFO L226 Difference]: Without dead ends: 2122 [2020-10-16 12:49:46,422 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-16 12:49:46,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-10-16 12:49:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-10-16 12:49:46,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-10-16 12:49:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions. [2020-10-16 12:49:46,705 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9 [2020-10-16 12:49:46,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:49:46,706 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions. [2020-10-16 12:49:46,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:49:46,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions. [2020-10-16 12:49:46,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:49:46,713 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:49:46,713 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:49:46,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:49:46,714 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:49:46,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:49:46,714 INFO L82 PathProgramCache]: Analyzing trace with hash 35482932, now seen corresponding path program 1 times [2020-10-16 12:49:46,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:49:46,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795370969] [2020-10-16 12:49:46,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:49:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:49:46,839 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-16 12:49:46,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795370969] [2020-10-16 12:49:46,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:49:46,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:49:46,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2015840038] [2020-10-16 12:49:46,840 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:49:46,842 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:49:46,844 INFO L258 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-16 12:49:46,844 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:49:46,844 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:49:46,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:49:46,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:49:46,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:49:46,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:49:46,847 INFO L87 Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand 3 states. [2020-10-16 12:49:46,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:49:46,880 INFO L93 Difference]: Finished difference Result 1930 states and 7248 transitions. [2020-10-16 12:49:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:49:46,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 12:49:46,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:49:46,902 INFO L225 Difference]: With dead ends: 1930 [2020-10-16 12:49:46,902 INFO L226 Difference]: Without dead ends: 1930 [2020-10-16 12:49:46,903 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-16 12:49:46,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2020-10-16 12:49:46,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1930. [2020-10-16 12:49:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1930 states. [2020-10-16 12:49:46,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 7248 transitions. [2020-10-16 12:49:46,988 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 7248 transitions. Word has length 11 [2020-10-16 12:49:46,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:49:46,988 INFO L481 AbstractCegarLoop]: Abstraction has 1930 states and 7248 transitions. [2020-10-16 12:49:46,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:49:46,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 7248 transitions. [2020-10-16 12:49:46,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:49:46,992 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:49:46,992 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:49:46,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:49:46,993 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:49:46,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:49:46,993 INFO L82 PathProgramCache]: Analyzing trace with hash -261685378, now seen corresponding path program 1 times [2020-10-16 12:49:47,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:49:47,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270886691] [2020-10-16 12:49:47,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:49:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:49:47,049 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-16 12:49:47,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270886691] [2020-10-16 12:49:47,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:49:47,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:49:47,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [539236956] [2020-10-16 12:49:47,050 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:49:47,052 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:49:47,056 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 29 transitions. [2020-10-16 12:49:47,057 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:49:47,104 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:49:47,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:49:47,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:49:47,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:49:47,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:49:47,105 INFO L87 Difference]: Start difference. First operand 1930 states and 7248 transitions. Second operand 3 states. [2020-10-16 12:49:47,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:49:47,138 INFO L93 Difference]: Finished difference Result 1834 states and 6848 transitions. [2020-10-16 12:49:47,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:49:47,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 12:49:47,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:49:47,158 INFO L225 Difference]: With dead ends: 1834 [2020-10-16 12:49:47,158 INFO L226 Difference]: Without dead ends: 1834 [2020-10-16 12:49:47,159 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-16 12:49:47,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2020-10-16 12:49:47,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1834. [2020-10-16 12:49:47,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1834 states. [2020-10-16 12:49:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 6848 transitions. [2020-10-16 12:49:47,241 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 6848 transitions. Word has length 13 [2020-10-16 12:49:47,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:49:47,241 INFO L481 AbstractCegarLoop]: Abstraction has 1834 states and 6848 transitions. [2020-10-16 12:49:47,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:49:47,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 6848 transitions. [2020-10-16 12:49:47,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:49:47,245 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:49:47,246 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:49:47,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:49:47,246 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:49:47,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:49:47,246 INFO L82 PathProgramCache]: Analyzing trace with hash 523837875, now seen corresponding path program 1 times [2020-10-16 12:49:47,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:49:47,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218781719] [2020-10-16 12:49:47,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:49:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:49:47,427 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-16 12:49:47,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218781719] [2020-10-16 12:49:47,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:49:47,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:49:47,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1198954894] [2020-10-16 12:49:47,428 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:49:47,431 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:49:47,441 INFO L258 McrAutomatonBuilder]: Finished intersection with 34 states and 55 transitions. [2020-10-16 12:49:47,441 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:49:47,489 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:49:47,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:49:47,545 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:49:47,593 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:49:47,618 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:49:47,628 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:49:47,675 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [24281#(not (= 4 ~__unbuffered_cnt~0))] [2020-10-16 12:49:47,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:49:47,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:49:47,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:49:47,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:49:47,677 INFO L87 Difference]: Start difference. First operand 1834 states and 6848 transitions. Second operand 5 states. [2020-10-16 12:49:47,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:49:47,780 INFO L93 Difference]: Finished difference Result 1417 states and 4731 transitions. [2020-10-16 12:49:47,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:49:47,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 12:49:47,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:49:47,789 INFO L225 Difference]: With dead ends: 1417 [2020-10-16 12:49:47,789 INFO L226 Difference]: Without dead ends: 937 [2020-10-16 12:49:47,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:49:47,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2020-10-16 12:49:47,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 937. [2020-10-16 12:49:47,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2020-10-16 12:49:47,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 2846 transitions. [2020-10-16 12:49:47,830 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 2846 transitions. Word has length 15 [2020-10-16 12:49:47,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:49:47,831 INFO L481 AbstractCegarLoop]: Abstraction has 937 states and 2846 transitions. [2020-10-16 12:49:47,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:49:47,831 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 2846 transitions. [2020-10-16 12:49:47,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:49:47,834 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:49:47,834 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] [2020-10-16 12:49:47,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:49:47,834 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:49:47,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:49:47,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1356517766, now seen corresponding path program 1 times [2020-10-16 12:49:47,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:49:47,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343517298] [2020-10-16 12:49:47,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:49:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:49:48,158 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-16 12:49:48,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343517298] [2020-10-16 12:49:48,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:49:48,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:49:48,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [529011573] [2020-10-16 12:49:48,159 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:49:48,166 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:49:48,226 INFO L258 McrAutomatonBuilder]: Finished intersection with 80 states and 151 transitions. [2020-10-16 12:49:48,226 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:49:48,545 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [27583#(<= ~__unbuffered_cnt~0 0)] [2020-10-16 12:49:48,545 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:49:48,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:49:48,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:49:48,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:49:48,546 INFO L87 Difference]: Start difference. First operand 937 states and 2846 transitions. Second operand 7 states. [2020-10-16 12:49:48,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:49:48,632 INFO L93 Difference]: Finished difference Result 825 states and 2477 transitions. [2020-10-16 12:49:48,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:49:48,633 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-16 12:49:48,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:49:48,640 INFO L225 Difference]: With dead ends: 825 [2020-10-16 12:49:48,640 INFO L226 Difference]: Without dead ends: 726 [2020-10-16 12:49:48,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:49:48,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2020-10-16 12:49:48,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2020-10-16 12:49:48,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2020-10-16 12:49:48,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 2213 transitions. [2020-10-16 12:49:48,669 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 2213 transitions. Word has length 20 [2020-10-16 12:49:48,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:49:48,670 INFO L481 AbstractCegarLoop]: Abstraction has 726 states and 2213 transitions. [2020-10-16 12:49:48,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:49:48,670 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 2213 transitions. [2020-10-16 12:49:48,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:49:48,673 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:49:48,674 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, 1] [2020-10-16 12:49:48,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:49:48,674 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:49:48,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:49:48,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1918261777, now seen corresponding path program 1 times [2020-10-16 12:49:48,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:49:48,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061868384] [2020-10-16 12:49:48,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:49:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:49:49,099 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 36 [2020-10-16 12:49:49,152 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-16 12:49:49,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061868384] [2020-10-16 12:49:49,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:49:49,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:49:49,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1740524483] [2020-10-16 12:49:49,154 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:49:49,162 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:49:49,332 INFO L258 McrAutomatonBuilder]: Finished intersection with 96 states and 179 transitions. [2020-10-16 12:49:49,332 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:49:49,427 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-16 12:49:49,427 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,428 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-16 12:49:49,429 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,430 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-16 12:49:49,430 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,433 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 12:49:49,433 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,436 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 12:49:49,436 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,437 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 12:49:49,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,442 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 12:49:49,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,443 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 12:49:49,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,445 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 12:49:49,445 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,457 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:49:49,471 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:49,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:49,542 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:49,651 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-16 12:49:49,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,653 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-16 12:49:49,653 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,654 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-16 12:49:49,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,656 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 12:49:49,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,658 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 12:49:49,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,659 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 12:49:49,659 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,661 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 12:49:49,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,663 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 12:49:49,664 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,665 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 12:49:49,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:49:49,677 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:49,687 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:49,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:49,748 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 12:49:49,749 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,750 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 12:49:49,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,751 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-10-16 12:49:49,751 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,753 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-10-16 12:49:49,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,754 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-16 12:49:49,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,926 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2020-10-16 12:49:49,974 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 12:49:49,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,975 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 12:49:49,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,976 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 3, 1] term [2020-10-16 12:49:49,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,990 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 12:49:49,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,991 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 4, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 12:49:49,992 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,992 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 3, 4, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 12:49:49,993 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,993 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 3, 4, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 12:49:49,994 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,994 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 4, 3, 1] term [2020-10-16 12:49:49,994 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,995 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 1] term [2020-10-16 12:49:49,995 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:49,996 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 1] term [2020-10-16 12:49:49,997 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 12:49:49,998 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 3, 3, 4, 3, 4, 3, 1] term [2020-10-16 12:49:49,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:49,999 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 4, 3, 1] term [2020-10-16 12:49:49,999 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:50,000 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 4, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 12:49:50,000 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:50,001 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 3, 3, 4, 3, 4, 3, 1] term [2020-10-16 12:49:50,001 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:50,002 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 4, 3, 1] term [2020-10-16 12:49:50,002 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:50,003 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 4, 3, 1] term [2020-10-16 12:49:50,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:50,003 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 1] term [2020-10-16 12:49:50,004 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 12:49:50,011 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 3, 3, 4, 4, 3, 4, 3, 4, 3, 3, 3, 1] term [2020-10-16 12:49:50,011 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:50,013 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 3, 4, 4, 3, 4, 3, 4, 3, 3, 3, 1] term [2020-10-16 12:49:50,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:50,014 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 2, 2, 2, 3, 4, 4, 3, 4, 3, 4, 3, 3, 3, 1] term [2020-10-16 12:49:50,014 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:50,017 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 3, 4, 3, 3, 3, 3, 3, 1] term [2020-10-16 12:49:50,018 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:50,019 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 3, 4, 3, 3, 3, 3, 3, 1] term [2020-10-16 12:49:50,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:50,021 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 3, 4, 3, 3, 3, 3, 3, 1] term [2020-10-16 12:49:50,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:50,023 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 3, 4, 3, 3, 3, 3, 3, 1] term [2020-10-16 12:49:50,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:50,026 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 4, 3, 3, 3, 1] term [2020-10-16 12:49:50,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:50,028 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 4, 3, 3, 3, 1] term [2020-10-16 12:49:50,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:50,031 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1] term [2020-10-16 12:49:50,031 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:50,034 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1] term [2020-10-16 12:49:50,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:50,037 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1] term [2020-10-16 12:49:50,037 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:50,039 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:50,042 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:50,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-16 12:49:50,057 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:50,081 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:50,128 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:50,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:50,292 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:50,419 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:50,522 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:51,463 WARN L193 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 35 [2020-10-16 12:49:51,528 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:49:51,528 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,529 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 12:49:51,529 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,530 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-10-16 12:49:51,530 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,532 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-10-16 12:49:51,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,533 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-16 12:49:51,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,606 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 12:49:51,606 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,607 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 12:49:51,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,608 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 3, 1] term [2020-10-16 12:49:51,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,619 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 12:49:51,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,625 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 3, 4, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 12:49:51,625 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,626 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 3, 4, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 12:49:51,626 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,627 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 3, 4, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 12:49:51,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,628 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 4, 3, 1] term [2020-10-16 12:49:51,628 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,628 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 1] term [2020-10-16 12:49:51,629 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 12:49:51,631 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 1] term [2020-10-16 12:49:51,631 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:51,632 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 3, 3, 4, 3, 4, 3, 1] term [2020-10-16 12:49:51,632 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,633 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 4, 3, 1] term [2020-10-16 12:49:51,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,634 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 4, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 12:49:51,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,634 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 4, 3, 1] term [2020-10-16 12:49:51,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,635 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 1] term [2020-10-16 12:49:51,635 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 12:49:51,636 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 3, 3, 4, 3, 4, 3, 1] term [2020-10-16 12:49:51,636 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,637 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 4, 3, 1] term [2020-10-16 12:49:51,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,639 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 3, 3, 4, 4, 3, 4, 3, 4, 3, 3, 3, 1] term [2020-10-16 12:49:51,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,641 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 3, 4, 4, 3, 4, 3, 4, 3, 3, 3, 1] term [2020-10-16 12:49:51,641 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,642 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 2, 2, 2, 3, 4, 4, 3, 4, 3, 4, 3, 3, 3, 1] term [2020-10-16 12:49:51,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,645 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 3, 4, 3, 3, 3, 3, 3, 1] term [2020-10-16 12:49:51,645 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,647 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 3, 4, 3, 3, 3, 3, 3, 1] term [2020-10-16 12:49:51,647 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,648 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 3, 4, 3, 3, 3, 3, 3, 1] term [2020-10-16 12:49:51,648 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,650 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 3, 4, 3, 3, 3, 3, 3, 1] term [2020-10-16 12:49:51,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,653 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 3, 3, 3, 3, 1] term [2020-10-16 12:49:51,653 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,654 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 3, 3, 3, 3, 1] term [2020-10-16 12:49:51,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,657 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1] term [2020-10-16 12:49:51,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,659 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1] term [2020-10-16 12:49:51,659 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,661 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1] term [2020-10-16 12:49:51,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,663 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:51,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:51,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:51,686 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:51,707 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:51,747 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:51,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:51,896 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:51,951 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:52,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:52,167 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-10-16 12:49:52,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,168 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-16 12:49:52,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,170 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 12:49:52,171 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,172 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 12:49:52,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,173 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-10-16 12:49:52,173 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,240 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 4, 2, 3, 1] term [2020-10-16 12:49:52,241 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,243 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 3, 3, 1] term [2020-10-16 12:49:52,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,244 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 4, 2, 3, 1] term [2020-10-16 12:49:52,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,245 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 4, 2, 3, 1] term [2020-10-16 12:49:52,245 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,247 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 3, 4, 2, 4, 2, 4, 2, 2, 1] term [2020-10-16 12:49:52,247 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,248 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 3, 4, 2, 4, 2, 4, 2, 2, 1] term [2020-10-16 12:49:52,249 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,249 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 3, 4, 2, 4, 2, 4, 2, 2, 1] term [2020-10-16 12:49:52,250 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,251 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,252 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,253 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,259 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,260 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,261 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,261 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,262 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,262 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,265 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,267 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,269 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,270 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,270 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,273 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,278 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 3, 4, 3, 4, 4, 4, 6, 4, 6, 3, 6, 2, 6, 2, 4, 2, 2, 1] term [2020-10-16 12:49:52,278 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,280 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 6, 4, 6, 3, 6, 2, 6, 2, 4, 2, 2, 1] term [2020-10-16 12:49:52,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,281 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 4, 4, 6, 4, 6, 3, 6, 2, 6, 2, 4, 2, 2, 1] term [2020-10-16 12:49:52,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,283 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 2, 4, 3, 4, 3, 4, 3, 4, 4, 4, 6, 4, 6, 3, 6, 2, 6, 2, 4, 2, 2, 1] term [2020-10-16 12:49:52,284 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,286 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 2, 6, 2, 4, 2, 2, 1] term [2020-10-16 12:49:52,287 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,288 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 2, 6, 2, 4, 2, 2, 1] term [2020-10-16 12:49:52,288 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,291 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 2, 6, 2, 4, 2, 2, 1] term [2020-10-16 12:49:52,291 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,295 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 2, 6, 2, 4, 2, 2, 1] term [2020-10-16 12:49:52,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,297 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 2, 6, 2, 4, 2, 2, 1] term [2020-10-16 12:49:52,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:52,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-16 12:49:52,322 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:52,337 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:52,375 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:52,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:52,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:52,541 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:52,610 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:52,721 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:49:52,722 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,722 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 12:49:52,723 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,723 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-10-16 12:49:52,723 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,725 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-10-16 12:49:52,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,727 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-16 12:49:52,727 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,810 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 4, 2, 3, 1] term [2020-10-16 12:49:52,811 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,813 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 3, 3, 1] term [2020-10-16 12:49:52,814 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,815 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 4, 2, 3, 1] term [2020-10-16 12:49:52,815 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,853 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 4, 2, 3, 1] term [2020-10-16 12:49:52,854 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,858 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 3, 4, 2, 4, 2, 4, 2, 2, 1] term [2020-10-16 12:49:52,858 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,859 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 3, 4, 2, 4, 2, 4, 2, 2, 1] term [2020-10-16 12:49:52,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,860 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 3, 4, 2, 4, 2, 4, 2, 2, 1] term [2020-10-16 12:49:52,860 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,864 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,866 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,867 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,868 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,871 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,874 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,874 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,875 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,879 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,879 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,880 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,881 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,882 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,885 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,889 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,890 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,892 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,893 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,893 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,896 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,897 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,899 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,900 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,900 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,903 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,904 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,905 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,905 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,906 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,908 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,911 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,913 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,914 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,915 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,917 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,918 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,919 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,921 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,923 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,925 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,925 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,926 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,930 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,930 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,931 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,933 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,936 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:49:52,941 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 3, 4, 3, 4, 6, 4, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 12:49:52,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,943 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 6, 4, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 12:49:52,943 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,944 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 6, 4, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 12:49:52,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,946 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 2, 4, 3, 4, 3, 4, 3, 4, 6, 4, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 12:49:52,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,947 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 12:49:52,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,949 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 12:49:52,950 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,952 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 12:49:52,952 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,955 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 12:49:52,956 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,957 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 12:49:52,957 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:49:52,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:49:52,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:52,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:52,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:53,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:53,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:53,119 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:53,159 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:53,231 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:49:53,322 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [29872#(or (not (= (mod ~z$w_buff0_used~0 256) 0)) (= ~z$r_buff0_thd3~0 0)), 29870#(and (or (and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff0~0 0)))) (= (mod ~z$w_buff0_used~0 256) 0) (= (mod ~z$r_buff0_thd4~0 256) 0)) (or (and (= ~z$r_buff0_thd3~0 0) (or (= (mod ~z$w_buff1_used~0 256) 0) (not (= ~__unbuffered_p3_EAX~0 1)) (= (mod ~z$r_buff1_thd4~0 256) 0)) (= ~z$r_buff1_thd3~0 0) (or (not (= ~z~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)))) (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd4~0 256) 0))))), 29871#(and (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (and (= ~z$r_buff0_thd3~0 0) (or (= (mod ~z$w_buff1_used~0 256) 0) (not (= ~z~0 1)) (= (mod ~z$r_buff1_thd4~0 256) 0)) (= ~z$r_buff1_thd3~0 0))) (or (= (mod ~z$w_buff0_used~0 256) 0) (and (= ~z$r_buff0_thd3~0 0) (or (= (mod ~z$w_buff1_used~0 256) 0) (= (mod ~z$r_buff1_thd4~0 256) 0) (and (not (= ~z$w_buff0~0 1)) (not (= (mod ~z$r_buff0_thd4~0 256) 0)))) (= ~z$r_buff1_thd3~0 0))))] [2020-10-16 12:49:53,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 12:49:53,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:49:53,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 12:49:53,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:49:53,323 INFO L87 Difference]: Start difference. First operand 726 states and 2213 transitions. Second operand 10 states. [2020-10-16 12:49:53,554 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 33 [2020-10-16 12:49:53,932 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2020-10-16 12:49:54,177 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2020-10-16 12:49:54,467 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2020-10-16 12:49:54,734 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2020-10-16 12:49:55,032 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-10-16 12:49:55,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:49:55,110 INFO L93 Difference]: Finished difference Result 817 states and 2418 transitions. [2020-10-16 12:49:55,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 12:49:55,111 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-10-16 12:49:55,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:49:55,118 INFO L225 Difference]: With dead ends: 817 [2020-10-16 12:49:55,118 INFO L226 Difference]: Without dead ends: 735 [2020-10-16 12:49:55,119 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 11 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2020-10-16 12:49:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2020-10-16 12:49:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 726. [2020-10-16 12:49:55,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2020-10-16 12:49:55,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 2180 transitions. [2020-10-16 12:49:55,170 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 2180 transitions. Word has length 23 [2020-10-16 12:49:55,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:49:55,170 INFO L481 AbstractCegarLoop]: Abstraction has 726 states and 2180 transitions. [2020-10-16 12:49:55,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 12:49:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 2180 transitions. [2020-10-16 12:49:55,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:49:55,172 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:49:55,173 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, 1] [2020-10-16 12:49:55,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:49:55,173 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:49:55,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:49:55,174 INFO L82 PathProgramCache]: Analyzing trace with hash 419801035, now seen corresponding path program 2 times [2020-10-16 12:49:55,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:49:55,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157087731] [2020-10-16 12:49:55,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:49:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:49:55,303 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-16 12:49:55,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157087731] [2020-10-16 12:49:55,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:49:55,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:49:55,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1783132915] [2020-10-16 12:49:55,304 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:49:55,311 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:49:55,365 INFO L258 McrAutomatonBuilder]: Finished intersection with 103 states and 199 transitions. [2020-10-16 12:49:55,366 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:49:55,642 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [32165#(<= ~__unbuffered_cnt~0 0)] [2020-10-16 12:49:55,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:49:55,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:49:55,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:49:55,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:49:55,643 INFO L87 Difference]: Start difference. First operand 726 states and 2180 transitions. Second operand 8 states. [2020-10-16 12:49:55,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:49:55,729 INFO L93 Difference]: Finished difference Result 701 states and 2128 transitions. [2020-10-16 12:49:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:49:55,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-10-16 12:49:55,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:49:55,734 INFO L225 Difference]: With dead ends: 701 [2020-10-16 12:49:55,734 INFO L226 Difference]: Without dead ends: 589 [2020-10-16 12:49:55,735 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:49:55,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-10-16 12:49:55,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2020-10-16 12:49:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2020-10-16 12:49:55,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1795 transitions. [2020-10-16 12:49:55,752 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 1795 transitions. Word has length 23 [2020-10-16 12:49:55,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:49:55,753 INFO L481 AbstractCegarLoop]: Abstraction has 589 states and 1795 transitions. [2020-10-16 12:49:55,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:49:55,753 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 1795 transitions. [2020-10-16 12:49:55,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-16 12:49:55,755 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:49:55,755 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, 1, 1, 1, 1] [2020-10-16 12:49:55,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:49:55,756 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:49:55,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:49:55,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1974188671, now seen corresponding path program 1 times [2020-10-16 12:49:55,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:49:55,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99735746] [2020-10-16 12:49:55,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:49:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:49:55,819 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-16 12:49:55,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99735746] [2020-10-16 12:49:55,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:49:55,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:49:55,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [356136852] [2020-10-16 12:49:55,820 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:49:55,826 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:49:55,934 INFO L258 McrAutomatonBuilder]: Finished intersection with 145 states and 294 transitions. [2020-10-16 12:49:55,934 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:49:56,307 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:49:56,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:49:56,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:49:56,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:49:56,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:49:56,308 INFO L87 Difference]: Start difference. First operand 589 states and 1795 transitions. Second operand 4 states. [2020-10-16 12:49:56,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:49:56,327 INFO L93 Difference]: Finished difference Result 807 states and 2391 transitions. [2020-10-16 12:49:56,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:49:56,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-16 12:49:56,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:49:56,330 INFO L225 Difference]: With dead ends: 807 [2020-10-16 12:49:56,331 INFO L226 Difference]: Without dead ends: 373 [2020-10-16 12:49:56,331 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 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-16 12:49:56,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2020-10-16 12:49:56,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2020-10-16 12:49:56,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-10-16 12:49:56,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1021 transitions. [2020-10-16 12:49:56,341 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1021 transitions. Word has length 26 [2020-10-16 12:49:56,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:49:56,342 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 1021 transitions. [2020-10-16 12:49:56,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:49:56,342 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1021 transitions. [2020-10-16 12:49:56,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-16 12:49:56,343 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:49:56,344 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, 1, 1, 1, 1] [2020-10-16 12:49:56,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:49:56,344 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:49:56,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:49:56,344 INFO L82 PathProgramCache]: Analyzing trace with hash 294332599, now seen corresponding path program 2 times [2020-10-16 12:49:56,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:49:56,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261514702] [2020-10-16 12:49:56,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:49:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:49:56,403 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-16 12:49:56,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261514702] [2020-10-16 12:49:56,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:49:56,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:49:56,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [324922861] [2020-10-16 12:49:56,405 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:49:56,415 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:49:56,486 INFO L258 McrAutomatonBuilder]: Finished intersection with 69 states and 113 transitions. [2020-10-16 12:49:56,486 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:49:56,521 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:49:56,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:49:56,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:49:56,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:49:56,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:49:56,523 INFO L87 Difference]: Start difference. First operand 373 states and 1021 transitions. Second operand 3 states. [2020-10-16 12:49:56,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:49:56,536 INFO L93 Difference]: Finished difference Result 487 states and 1311 transitions. [2020-10-16 12:49:56,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:49:56,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-10-16 12:49:56,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:49:56,538 INFO L225 Difference]: With dead ends: 487 [2020-10-16 12:49:56,538 INFO L226 Difference]: Without dead ends: 205 [2020-10-16 12:49:56,539 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-16 12:49:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-10-16 12:49:56,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2020-10-16 12:49:56,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-10-16 12:49:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 497 transitions. [2020-10-16 12:49:56,545 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 497 transitions. Word has length 26 [2020-10-16 12:49:56,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:49:56,545 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 497 transitions. [2020-10-16 12:49:56,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:49:56,545 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 497 transitions. [2020-10-16 12:49:56,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-16 12:49:56,575 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:49:56,575 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, 1, 1, 1, 1] [2020-10-16 12:49:56,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:49:56,575 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:49:56,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:49:56,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1948896009, now seen corresponding path program 3 times [2020-10-16 12:49:56,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:49:56,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329470284] [2020-10-16 12:49:56,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:49:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:49:56,628 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:49:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:49:56,751 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:49:56,837 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:49:56,837 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:49:56,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:49:56,840 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:49:56,872 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1199] [1199] L2-->L876: Formula: (let ((.cse6 (= (mod ~z$w_buff1_used~0_In-2012789806 256) 0)) (.cse7 (= (mod ~z$r_buff1_thd0~0_In-2012789806 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In-2012789806 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In-2012789806 256) 0))) (let ((.cse0 (or .cse8 .cse9)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse1 (or .cse6 .cse7)) (.cse2 (not .cse7)) (.cse3 (not .cse6))) (and (= ~z$r_buff1_thd0~0_Out-2012789806 ~z$r_buff1_thd0~0_In-2012789806) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-2012789806 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-2012789806|) (= ~z$r_buff0_thd0~0_In-2012789806 ~z$r_buff0_thd0~0_Out-2012789806) (or (and .cse0 (or (and (= ~z~0_Out-2012789806 ~z~0_In-2012789806) .cse1) (and .cse2 .cse3 (= ~z~0_Out-2012789806 ~z$w_buff1~0_In-2012789806)))) (and .cse4 (= ~z~0_Out-2012789806 ~z$w_buff0~0_In-2012789806) .cse5)) (or (and (= ~z$w_buff0_used~0_Out-2012789806 ~z$w_buff0_used~0_In-2012789806) .cse0) (and (= ~z$w_buff0_used~0_Out-2012789806 0) .cse4 .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-2012789806 0)) (or (and (= ~z$w_buff1_used~0_In-2012789806 ~z$w_buff1_used~0_Out-2012789806) .cse1) (and .cse2 .cse3 (= ~z$w_buff1_used~0_Out-2012789806 0)))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2012789806|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2012789806, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2012789806, ~z$w_buff0~0=~z$w_buff0~0_In-2012789806, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2012789806, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2012789806, ~z$w_buff1~0=~z$w_buff1~0_In-2012789806, ~z~0=~z~0_In-2012789806} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-2012789806, ~z$w_buff0~0=~z$w_buff0~0_In-2012789806, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-2012789806, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-2012789806|, ~z$w_buff1~0=~z$w_buff1~0_In-2012789806, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-2012789806|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-2012789806|, ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-2012789806|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2012789806|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-2012789806, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-2012789806|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-2012789806|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-2012789806, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-2012789806, ~z~0=~z~0_Out-2012789806} 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, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2020-10-16 12:49:56,885 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-16 12:49:56,885 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,886 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-16 12:49:56,886 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,886 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-16 12:49:56,886 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,886 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-16 12:49:56,887 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,887 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-16 12:49:56,887 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,887 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-16 12:49:56,887 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,887 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-16 12:49:56,887 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,888 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-16 12:49:56,888 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,888 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-16 12:49:56,889 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,889 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-16 12:49:56,889 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,889 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-16 12:49:56,889 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,889 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-16 12:49:56,890 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,890 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-16 12:49:56,890 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,890 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-16 12:49:56,890 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,898 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-16 12:49:56,898 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,898 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-16 12:49:56,899 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,899 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-16 12:49:56,899 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,899 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-16 12:49:56,900 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,900 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-16 12:49:56,900 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,900 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-16 12:49:56,900 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,900 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-16 12:49:56,901 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,901 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-16 12:49:56,902 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,902 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-16 12:49:56,902 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,902 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-16 12:49:56,902 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,903 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-16 12:49:56,903 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,903 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-16 12:49:56,903 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,903 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-16 12:49:56,904 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,904 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-16 12:49:56,904 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,905 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-16 12:49:56,905 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,905 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-16 12:49:56,905 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,905 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-16 12:49:56,906 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:56,906 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-16 12:49:56,906 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:49:57,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:49:57 BasicIcfg [2020-10-16 12:49:57,035 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:49:57,037 INFO L168 Benchmark]: Toolchain (without parser) took 18396.30 ms. Allocated memory was 138.4 MB in the beginning and 607.1 MB in the end (delta: 468.7 MB). Free memory was 99.6 MB in the beginning and 465.0 MB in the end (delta: -365.4 MB). Peak memory consumption was 103.3 MB. Max. memory is 7.1 GB. [2020-10-16 12:49:57,037 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 12:49:57,038 INFO L168 Benchmark]: CACSL2BoogieTranslator took 811.49 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 99.2 MB in the beginning and 155.4 MB in the end (delta: -56.2 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2020-10-16 12:49:57,039 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.70 ms. Allocated memory is still 202.9 MB. Free memory was 155.4 MB in the beginning and 152.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-16 12:49:57,040 INFO L168 Benchmark]: Boogie Preprocessor took 59.30 ms. Allocated memory is still 202.9 MB. Free memory was 152.0 MB in the beginning and 149.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-16 12:49:57,040 INFO L168 Benchmark]: RCFGBuilder took 2520.57 ms. Allocated memory was 202.9 MB in the beginning and 252.2 MB in the end (delta: 49.3 MB). Free memory was 149.2 MB in the beginning and 125.0 MB in the end (delta: 24.1 MB). Peak memory consumption was 103.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:49:57,041 INFO L168 Benchmark]: TraceAbstraction took 14928.46 ms. Allocated memory was 252.2 MB in the beginning and 607.1 MB in the end (delta: 354.9 MB). Free memory was 123.1 MB in the beginning and 465.0 MB in the end (delta: -341.9 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2020-10-16 12:49:57,046 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 811.49 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 99.2 MB in the beginning and 155.4 MB in the end (delta: -56.2 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.70 ms. Allocated memory is still 202.9 MB. Free memory was 155.4 MB in the beginning and 152.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.30 ms. Allocated memory is still 202.9 MB. Free memory was 152.0 MB in the beginning and 149.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2520.57 ms. Allocated memory was 202.9 MB in the beginning and 252.2 MB in the end (delta: 49.3 MB). Free memory was 149.2 MB in the beginning and 125.0 MB in the end (delta: 24.1 MB). Peak memory consumption was 103.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14928.46 ms. Allocated memory was 252.2 MB in the beginning and 607.1 MB in the end (delta: 354.9 MB). Free memory was 123.1 MB in the beginning and 465.0 MB in the end (delta: -341.9 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1284 VarBasedMoverChecksPositive, 46 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 119 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.3s, 123 PlacesBefore, 45 PlacesAfterwards, 112 TransitionsBefore, 32 TransitionsAfterwards, 2446 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 92 TotalNumberOfCompositions, 7121 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p2_EBX = 0; [L707] 0 int __unbuffered_p3_EAX = 0; [L709] 0 int __unbuffered_p3_EBX = 0; [L711] 0 int a = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff0_thd4; [L727] 0 _Bool z$r_buff1_thd0; [L728] 0 _Bool z$r_buff1_thd1; [L729] 0 _Bool z$r_buff1_thd2; [L730] 0 _Bool z$r_buff1_thd3; [L731] 0 _Bool z$r_buff1_thd4; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L858] 0 pthread_t t189; [L859] FCALL, FORK 0 pthread_create(&t189, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t190; [L861] FCALL, FORK 0 pthread_create(&t190, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 pthread_t t191; [L863] FCALL, FORK 0 pthread_create(&t191, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 pthread_t t192; [L865] FCALL, FORK 0 pthread_create(&t192, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 4 z$w_buff1 = z$w_buff0 [L805] 4 z$w_buff0 = 1 [L806] 4 z$w_buff1_used = z$w_buff0_used [L807] 4 z$w_buff0_used = (_Bool)1 [L7] COND FALSE 4 !(!expression) [L809] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 4 z$flush_delayed = weak$$choice2 [L820] 4 z$mem_tmp = z [L821] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L821] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L821] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L821] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L822] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L822] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0) [L822] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L822] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L823] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L823] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1) [L823] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L823] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L824] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L824] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L825] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L825] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L826] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4) [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4) [L826] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L826] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L827] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L827] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L828] 4 __unbuffered_p3_EAX = z [L829] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L829] 4 z = z$flush_delayed ? z$mem_tmp : z [L830] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L766] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 2 return 0; [L773] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 3 z$flush_delayed = weak$$choice2 [L782] 3 z$mem_tmp = z [L783] 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) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 [L783] 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) [L783] 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) [L784] 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)) [L784] 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) [L784] 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)) [L784] 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)) [L785] 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)) [L785] EXPR 3 !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) [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1 [L785] EXPR 3 !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) [L785] 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)) [L785] 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)) [L786] 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)) [L786] 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)) [L787] 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)) [L787] EXPR 3 !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) [L787] 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)) [L787] 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)) [L788] 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)) [L788] 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)) [L789] 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)) [L789] 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)) [L790] 3 __unbuffered_p2_EBX = z [L791] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L791] 3 z = z$flush_delayed ? z$mem_tmp : z [L792] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L836] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L836] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L837] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L837] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L838] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L838] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L839] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L839] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L840] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L840] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L878] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.5s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 298 SDtfs, 503 SDslu, 550 SDs, 0 SdLazy, 215 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 306 GetRequests, 254 SyntacticMatches, 11 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3002occurred 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.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 14981 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...