/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/mix057_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 15:26:33,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 15:26:33,608 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 15:26:33,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 15:26:33,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 15:26:33,653 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 15:26:33,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 15:26:33,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 15:26:33,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 15:26:33,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 15:26:33,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 15:26:33,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 15:26:33,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 15:26:33,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 15:26:33,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 15:26:33,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 15:26:33,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 15:26:33,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 15:26:33,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 15:26:33,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 15:26:33,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 15:26:33,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 15:26:33,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 15:26:33,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 15:26:33,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 15:26:33,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 15:26:33,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 15:26:33,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 15:26:33,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 15:26:33,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 15:26:33,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 15:26:33,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 15:26:33,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 15:26:33,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 15:26:33,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 15:26:33,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 15:26:33,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 15:26:33,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 15:26:33,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 15:26:33,732 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 15:26:33,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 15:26:33,734 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-11-09 15:26:33,794 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 15:26:33,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 15:26:33,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 15:26:33,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 15:26:33,800 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 15:26:33,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 15:26:33,801 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 15:26:33,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 15:26:33,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 15:26:33,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 15:26:33,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 15:26:33,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 15:26:33,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 15:26:33,805 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 15:26:33,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 15:26:33,805 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 15:26:33,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 15:26:33,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 15:26:33,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 15:26:33,807 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 15:26:33,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 15:26:33,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 15:26:33,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 15:26:33,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 15:26:33,808 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 15:26:33,808 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 15:26:33,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 15:26:33,809 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 15:26:33,809 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 15:26:33,809 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 15:26:33,810 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 15:26:34,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 15:26:34,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 15:26:34,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 15:26:34,326 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 15:26:34,327 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 15:26:34,329 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.oepc.i [2020-11-09 15:26:34,421 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96fc09901/1c2f6aab92f647659936a57be08206a8/FLAG4f2cd4b40 [2020-11-09 15:26:35,082 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 15:26:35,083 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_tso.oepc.i [2020-11-09 15:26:35,109 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96fc09901/1c2f6aab92f647659936a57be08206a8/FLAG4f2cd4b40 [2020-11-09 15:26:35,385 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96fc09901/1c2f6aab92f647659936a57be08206a8 [2020-11-09 15:26:35,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 15:26:35,397 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 15:26:35,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 15:26:35,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 15:26:35,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 15:26:35,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:26:35" (1/1) ... [2020-11-09 15:26:35,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f0dda9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:35, skipping insertion in model container [2020-11-09 15:26:35,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:26:35" (1/1) ... [2020-11-09 15:26:35,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 15:26:35,506 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 15:26:36,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:26:36,120 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 15:26:36,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:26:36,299 INFO L208 MainTranslator]: Completed translation [2020-11-09 15:26:36,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:36 WrapperNode [2020-11-09 15:26:36,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 15:26:36,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 15:26:36,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 15:26:36,303 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 15:26:36,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:36" (1/1) ... [2020-11-09 15:26:36,363 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:36" (1/1) ... [2020-11-09 15:26:36,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 15:26:36,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 15:26:36,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 15:26:36,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 15:26:36,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:36" (1/1) ... [2020-11-09 15:26:36,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:36" (1/1) ... [2020-11-09 15:26:36,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:36" (1/1) ... [2020-11-09 15:26:36,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:36" (1/1) ... [2020-11-09 15:26:36,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:36" (1/1) ... [2020-11-09 15:26:36,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:36" (1/1) ... [2020-11-09 15:26:36,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:36" (1/1) ... [2020-11-09 15:26:36,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 15:26:36,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 15:26:36,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 15:26:36,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 15:26:36,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 15:26:36,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 15:26:36,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 15:26:36,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 15:26:36,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 15:26:36,575 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 15:26:36,576 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 15:26:36,576 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 15:26:36,577 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 15:26:36,577 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 15:26:36,578 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 15:26:36,578 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-09 15:26:36,578 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-09 15:26:36,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 15:26:36,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 15:26:36,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 15:26:36,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 15:26:36,581 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 15:26:39,286 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 15:26:39,286 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 15:26:39,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:26:39 BoogieIcfgContainer [2020-11-09 15:26:39,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 15:26:39,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 15:26:39,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 15:26:39,294 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 15:26:39,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 03:26:35" (1/3) ... [2020-11-09 15:26:39,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d99c7b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:26:39, skipping insertion in model container [2020-11-09 15:26:39,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:36" (2/3) ... [2020-11-09 15:26:39,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d99c7b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:26:39, skipping insertion in model container [2020-11-09 15:26:39,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:26:39" (3/3) ... [2020-11-09 15:26:39,298 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_tso.oepc.i [2020-11-09 15:26:39,315 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 15:26:39,315 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 15:26:39,319 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 15:26:39,320 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 15:26:39,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,360 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,360 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,361 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,361 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,363 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,363 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,363 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,364 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,365 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,365 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,366 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,366 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,371 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,371 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,372 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,372 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,372 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,373 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,374 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,375 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,377 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,377 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,377 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,377 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,378 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,378 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,378 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,378 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,378 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,378 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,379 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,379 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,385 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,386 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,386 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,386 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,386 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,386 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,387 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,387 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,387 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,387 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,387 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,388 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,392 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,392 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,396 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,397 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,399 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,399 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:39,402 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 15:26:39,414 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-09 15:26:39,437 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 15:26:39,437 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 15:26:39,438 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 15:26:39,438 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 15:26:39,438 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 15:26:39,438 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 15:26:39,438 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 15:26:39,438 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 15:26:39,452 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 15:26:39,452 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 116 transitions, 252 flow [2020-11-09 15:26:39,456 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 116 transitions, 252 flow [2020-11-09 15:26:39,458 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 116 transitions, 252 flow [2020-11-09 15:26:39,514 INFO L129 PetriNetUnfolder]: 3/112 cut-off events. [2020-11-09 15:26:39,514 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 15:26:39,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 3/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-11-09 15:26:39,524 INFO L116 LiptonReduction]: Number of co-enabled transitions 2622 [2020-11-09 15:26:40,783 WARN L194 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-09 15:26:40,922 WARN L194 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-09 15:26:41,517 WARN L194 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-11-09 15:26:41,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 15:26:41,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:41,994 WARN L194 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2020-11-09 15:26:42,242 WARN L194 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-09 15:26:42,373 WARN L194 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-11-09 15:26:42,508 WARN L194 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-11-09 15:26:45,447 WARN L194 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-11-09 15:26:45,669 WARN L194 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-11-09 15:26:47,170 WARN L194 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 231 DAG size of output: 191 [2020-11-09 15:26:47,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-09 15:26:47,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:47,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 15:26:47,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:48,477 WARN L194 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 148 DAG size of output: 110 [2020-11-09 15:26:51,001 WARN L194 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 315 DAG size of output: 270 [2020-11-09 15:26:51,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:26:51,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:26:51,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:26:51,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:26:51,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:51,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:26:51,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:26:51,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:26:51,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:51,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:26:51,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:26:51,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:26:51,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:51,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:26:51,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:26:51,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:26:51,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:51,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:26:51,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 1] term [2020-11-09 15:26:51,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:51,087 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-11-09 15:26:51,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:51,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:26:51,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:51,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 3, 2, 1] term [2020-11-09 15:26:51,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 2, 1] term [2020-11-09 15:26:51,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:51,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 3, 2, 1] term [2020-11-09 15:26:51,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:26:51,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 1] term [2020-11-09 15:26:51,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:51,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-09 15:26:51,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:54,546 WARN L194 SmtUtils]: Spent 3.40 s on a formula simplification. DAG size of input: 378 DAG size of output: 232 [2020-11-09 15:26:55,936 WARN L194 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 231 DAG size of output: 191 [2020-11-09 15:26:55,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-09 15:26:55,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:55,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 15:26:55,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:57,311 WARN L194 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 148 DAG size of output: 109 [2020-11-09 15:27:00,133 WARN L194 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 315 DAG size of output: 271 [2020-11-09 15:27:00,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:27:00,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:00,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:27:00,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:00,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:00,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:00,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:00,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:00,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:27:00,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:00,167 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-11-09 15:27:00,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:00,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:27:00,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:00,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:27:00,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:00,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:27:00,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:00,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:27:00,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:00,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:27:00,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:00,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:27:00,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:00,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:27:00,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:00,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:27:00,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:00,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:27:00,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:00,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:27:00,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:00,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:27:00,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:00,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:27:00,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:00,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:27:00,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:03,806 WARN L194 SmtUtils]: Spent 3.55 s on a formula simplification. DAG size of input: 362 DAG size of output: 233 [2020-11-09 15:27:03,970 WARN L194 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 15:27:04,127 WARN L194 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 15:27:04,284 WARN L194 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 15:27:04,439 WARN L194 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 15:27:05,168 WARN L194 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-11-09 15:27:05,438 WARN L194 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-09 15:27:05,992 WARN L194 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-11-09 15:27:06,262 WARN L194 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-09 15:27:07,707 WARN L194 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 247 DAG size of output: 207 [2020-11-09 15:27:07,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-09 15:27:07,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:07,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 15:27:07,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:09,242 WARN L194 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 164 DAG size of output: 135 [2020-11-09 15:27:14,270 WARN L194 SmtUtils]: Spent 5.03 s on a formula simplification. DAG size of input: 331 DAG size of output: 287 [2020-11-09 15:27:14,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:27:14,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:14,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:27:14,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:14,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:27:14,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:14,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:27:14,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:14,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:27:14,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:14,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:27:14,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:14,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:27:14,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:14,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:27:14,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:14,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:27:14,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:14,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:27:14,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:14,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:27:14,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:14,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:27:14,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:14,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:14,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 15:27:14,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:27:14,334 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-11-09 15:27:14,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:27:14,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:14,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:14,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 2, 1] term [2020-11-09 15:27:14,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:14,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-09 15:27:14,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:14,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:14,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:14,360 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-11-09 15:27:14,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:14,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:27:14,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:14,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:27:14,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:27:14,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:27:14,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:23,432 WARN L194 SmtUtils]: Spent 9.05 s on a formula simplification. DAG size of input: 389 DAG size of output: 290 [2020-11-09 15:27:23,510 INFO L131 LiptonReduction]: Checked pairs total: 7247 [2020-11-09 15:27:23,510 INFO L133 LiptonReduction]: Total number of compositions: 103 [2020-11-09 15:27:23,517 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-11-09 15:27:23,738 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-11-09 15:27:23,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-11-09 15:27:23,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 15:27:23,752 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:23,753 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:23,753 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-11-09 15:27:23,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:23,764 INFO L82 PathProgramCache]: Analyzing trace with hash 477405012, now seen corresponding path program 1 times [2020-11-09 15:27:23,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:23,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474130345] [2020-11-09 15:27:23,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:24,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:24,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474130345] [2020-11-09 15:27:24,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:24,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:27:24,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [7316706] [2020-11-09 15:27:24,091 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:24,100 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:24,127 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-11-09 15:27:24,128 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:24,133 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:24,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:27:24,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:24,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:27:24,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:27:24,156 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-11-09 15:27:24,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:24,329 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-11-09 15:27:24,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:27:24,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-09 15:27:24,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:24,370 INFO L225 Difference]: With dead ends: 2202 [2020-11-09 15:27:24,370 INFO L226 Difference]: Without dead ends: 1802 [2020-11-09 15:27:24,371 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-11-09 15:27:24,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-11-09 15:27:24,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-11-09 15:27:24,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-11-09 15:27:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-11-09 15:27:24,536 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-11-09 15:27:24,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:24,538 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-11-09 15:27:24,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:27:24,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-11-09 15:27:24,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 15:27:24,541 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:24,541 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:24,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 15:27:24,541 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-11-09 15:27:24,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:24,542 INFO L82 PathProgramCache]: Analyzing trace with hash -775206985, now seen corresponding path program 1 times [2020-11-09 15:27:24,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:24,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872696563] [2020-11-09 15:27:24,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:24,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872696563] [2020-11-09 15:27:24,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:24,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:27:24,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [511527660] [2020-11-09 15:27:24,722 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:24,723 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:24,725 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-11-09 15:27:24,725 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:24,726 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:24,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:27:24,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:24,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:27:24,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:27:24,730 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-11-09 15:27:24,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:24,811 INFO L93 Difference]: Finished difference Result 1794 states and 6746 transitions. [2020-11-09 15:27:24,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:27:24,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-09 15:27:24,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:24,831 INFO L225 Difference]: With dead ends: 1794 [2020-11-09 15:27:24,832 INFO L226 Difference]: Without dead ends: 1794 [2020-11-09 15:27:24,833 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-11-09 15:27:24,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2020-11-09 15:27:24,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1794. [2020-11-09 15:27:24,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2020-11-09 15:27:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 6746 transitions. [2020-11-09 15:27:24,918 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 6746 transitions. Word has length 11 [2020-11-09 15:27:24,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:24,919 INFO L481 AbstractCegarLoop]: Abstraction has 1794 states and 6746 transitions. [2020-11-09 15:27:24,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:27:24,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 6746 transitions. [2020-11-09 15:27:24,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 15:27:24,927 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:24,928 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:24,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 15:27:24,928 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-11-09 15:27:24,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:24,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1736968243, now seen corresponding path program 1 times [2020-11-09 15:27:24,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:24,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312880836] [2020-11-09 15:27:24,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:25,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312880836] [2020-11-09 15:27:25,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:25,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:27:25,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [303299440] [2020-11-09 15:27:25,078 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:25,080 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:25,083 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 14 transitions. [2020-11-09 15:27:25,083 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:25,115 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:25,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:27:25,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:25,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:27:25,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:27:25,117 INFO L87 Difference]: Start difference. First operand 1794 states and 6746 transitions. Second operand 3 states. [2020-11-09 15:27:25,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:25,152 INFO L93 Difference]: Finished difference Result 1762 states and 6602 transitions. [2020-11-09 15:27:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:27:25,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-11-09 15:27:25,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:25,173 INFO L225 Difference]: With dead ends: 1762 [2020-11-09 15:27:25,174 INFO L226 Difference]: Without dead ends: 1762 [2020-11-09 15:27:25,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:27:25,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2020-11-09 15:27:25,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1762. [2020-11-09 15:27:25,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2020-11-09 15:27:25,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 6602 transitions. [2020-11-09 15:27:25,262 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 6602 transitions. Word has length 12 [2020-11-09 15:27:25,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:25,262 INFO L481 AbstractCegarLoop]: Abstraction has 1762 states and 6602 transitions. [2020-11-09 15:27:25,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:27:25,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 6602 transitions. [2020-11-09 15:27:25,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 15:27:25,264 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:25,264 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:25,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 15:27:25,265 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-11-09 15:27:25,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:25,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1738386307, now seen corresponding path program 1 times [2020-11-09 15:27:25,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:25,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763626615] [2020-11-09 15:27:25,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:25,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:25,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763626615] [2020-11-09 15:27:25,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:25,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:27:25,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [620314331] [2020-11-09 15:27:25,389 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:25,391 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:25,395 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 20 transitions. [2020-11-09 15:27:25,395 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:25,522 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:25,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:27:25,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:25,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:27:25,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:27:25,523 INFO L87 Difference]: Start difference. First operand 1762 states and 6602 transitions. Second operand 3 states. [2020-11-09 15:27:25,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:25,602 INFO L93 Difference]: Finished difference Result 1754 states and 6564 transitions. [2020-11-09 15:27:25,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:27:25,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-11-09 15:27:25,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:25,623 INFO L225 Difference]: With dead ends: 1754 [2020-11-09 15:27:25,624 INFO L226 Difference]: Without dead ends: 1754 [2020-11-09 15:27:25,624 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-09 15:27:25,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2020-11-09 15:27:25,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1754. [2020-11-09 15:27:25,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2020-11-09 15:27:25,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 6564 transitions. [2020-11-09 15:27:25,731 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 6564 transitions. Word has length 12 [2020-11-09 15:27:25,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:25,732 INFO L481 AbstractCegarLoop]: Abstraction has 1754 states and 6564 transitions. [2020-11-09 15:27:25,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:27:25,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 6564 transitions. [2020-11-09 15:27:25,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 15:27:25,734 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:25,734 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:25,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 15:27:25,734 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-11-09 15:27:25,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:25,735 INFO L82 PathProgramCache]: Analyzing trace with hash -709915685, now seen corresponding path program 1 times [2020-11-09 15:27:25,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:25,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036610693] [2020-11-09 15:27:25,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:25,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036610693] [2020-11-09 15:27:25,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:25,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:27:25,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1373844146] [2020-11-09 15:27:25,852 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:25,854 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:25,859 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 37 transitions. [2020-11-09 15:27:25,859 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:26,024 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:26,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:27:26,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:26,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:27:26,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:27:26,025 INFO L87 Difference]: Start difference. First operand 1754 states and 6564 transitions. Second operand 4 states. [2020-11-09 15:27:26,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:26,133 INFO L93 Difference]: Finished difference Result 1938 states and 7170 transitions. [2020-11-09 15:27:26,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:27:26,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-09 15:27:26,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:26,156 INFO L225 Difference]: With dead ends: 1938 [2020-11-09 15:27:26,156 INFO L226 Difference]: Without dead ends: 1938 [2020-11-09 15:27:26,157 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:27:26,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2020-11-09 15:27:26,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1906. [2020-11-09 15:27:26,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1906 states. [2020-11-09 15:27:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 7074 transitions. [2020-11-09 15:27:26,242 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 7074 transitions. Word has length 13 [2020-11-09 15:27:26,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:26,242 INFO L481 AbstractCegarLoop]: Abstraction has 1906 states and 7074 transitions. [2020-11-09 15:27:26,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:27:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 7074 transitions. [2020-11-09 15:27:26,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 15:27:26,245 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:26,245 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:26,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 15:27:26,245 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-11-09 15:27:26,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:26,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1037055385, now seen corresponding path program 1 times [2020-11-09 15:27:26,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:26,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981150473] [2020-11-09 15:27:26,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:26,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981150473] [2020-11-09 15:27:26,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:26,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:27:26,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [271251436] [2020-11-09 15:27:26,485 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:26,487 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:26,491 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 47 transitions. [2020-11-09 15:27:26,492 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:26,496 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:27:26,496 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:26,497 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:26,497 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:26,706 WARN L194 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 14 [2020-11-09 15:27:26,725 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:27:26,725 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:26,726 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:26,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:26,806 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:27:26,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:26,807 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:26,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:26,935 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [32839#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (<= ~z$w_buff1~0 0) (or (= ~z$w_buff1~0 0) (= (mod ~z$r_buff1_thd0~0 256) 0)))] [2020-11-09 15:27:26,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:27:26,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:26,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:27:26,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:27:26,937 INFO L87 Difference]: Start difference. First operand 1906 states and 7074 transitions. Second operand 5 states. [2020-11-09 15:27:27,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:27,085 INFO L93 Difference]: Finished difference Result 1844 states and 6800 transitions. [2020-11-09 15:27:27,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:27:27,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-09 15:27:27,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:27,105 INFO L225 Difference]: With dead ends: 1844 [2020-11-09 15:27:27,105 INFO L226 Difference]: Without dead ends: 1844 [2020-11-09 15:27:27,105 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:27:27,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2020-11-09 15:27:27,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1844. [2020-11-09 15:27:27,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1844 states. [2020-11-09 15:27:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 6800 transitions. [2020-11-09 15:27:27,180 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 6800 transitions. Word has length 13 [2020-11-09 15:27:27,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:27,181 INFO L481 AbstractCegarLoop]: Abstraction has 1844 states and 6800 transitions. [2020-11-09 15:27:27,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:27:27,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 6800 transitions. [2020-11-09 15:27:27,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 15:27:27,184 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:27,184 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:27,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 15:27:27,185 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-11-09 15:27:27,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:27,185 INFO L82 PathProgramCache]: Analyzing trace with hash -2083948285, now seen corresponding path program 1 times [2020-11-09 15:27:27,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:27,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266580162] [2020-11-09 15:27:27,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:27,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266580162] [2020-11-09 15:27:27,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:27,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:27:27,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1700379591] [2020-11-09 15:27:27,281 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:27,283 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:27,289 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 50 transitions. [2020-11-09 15:27:27,289 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:27,535 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:27,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:27:27,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:27,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:27:27,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:27:27,536 INFO L87 Difference]: Start difference. First operand 1844 states and 6800 transitions. Second operand 4 states. [2020-11-09 15:27:27,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:27,622 INFO L93 Difference]: Finished difference Result 1868 states and 6882 transitions. [2020-11-09 15:27:27,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:27:27,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-09 15:27:27,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:27,653 INFO L225 Difference]: With dead ends: 1868 [2020-11-09 15:27:27,653 INFO L226 Difference]: Without dead ends: 1868 [2020-11-09 15:27:27,655 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:27:27,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2020-11-09 15:27:27,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1860. [2020-11-09 15:27:27,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1860 states. [2020-11-09 15:27:27,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 6856 transitions. [2020-11-09 15:27:27,741 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 6856 transitions. Word has length 14 [2020-11-09 15:27:27,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:27,741 INFO L481 AbstractCegarLoop]: Abstraction has 1860 states and 6856 transitions. [2020-11-09 15:27:27,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:27:27,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 6856 transitions. [2020-11-09 15:27:27,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 15:27:27,744 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:27,745 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:27,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 15:27:27,745 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-11-09 15:27:27,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:27,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2085272605, now seen corresponding path program 2 times [2020-11-09 15:27:27,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:27,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302488900] [2020-11-09 15:27:27,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:27,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:27,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302488900] [2020-11-09 15:27:27,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:27,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:27:27,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1210210047] [2020-11-09 15:27:27,999 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:28,001 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:28,006 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 60 transitions. [2020-11-09 15:27:28,006 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:28,064 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:27:28,064 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:28,065 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:28,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:28,244 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:28,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:27:28,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:28,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:27:28,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:27:28,245 INFO L87 Difference]: Start difference. First operand 1860 states and 6856 transitions. Second operand 5 states. [2020-11-09 15:27:28,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:28,417 INFO L93 Difference]: Finished difference Result 1826 states and 6710 transitions. [2020-11-09 15:27:28,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:27:28,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-09 15:27:28,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:28,446 INFO L225 Difference]: With dead ends: 1826 [2020-11-09 15:27:28,446 INFO L226 Difference]: Without dead ends: 1826 [2020-11-09 15:27:28,446 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:27:28,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2020-11-09 15:27:28,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1642. [2020-11-09 15:27:28,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1642 states. [2020-11-09 15:27:28,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 6084 transitions. [2020-11-09 15:27:28,540 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 6084 transitions. Word has length 14 [2020-11-09 15:27:28,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:28,540 INFO L481 AbstractCegarLoop]: Abstraction has 1642 states and 6084 transitions. [2020-11-09 15:27:28,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:27:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 6084 transitions. [2020-11-09 15:27:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 15:27:28,543 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:28,543 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:28,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 15:27:28,544 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-11-09 15:27:28,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:28,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1515827997, now seen corresponding path program 1 times [2020-11-09 15:27:28,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:28,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677740380] [2020-11-09 15:27:28,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:28,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:28,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677740380] [2020-11-09 15:27:28,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:28,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:27:28,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1379536066] [2020-11-09 15:27:28,621 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:28,623 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:28,627 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 29 transitions. [2020-11-09 15:27:28,628 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:28,737 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:28,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:27:28,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:28,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:27:28,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:27:28,739 INFO L87 Difference]: Start difference. First operand 1642 states and 6084 transitions. Second operand 3 states. [2020-11-09 15:27:28,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:28,761 INFO L93 Difference]: Finished difference Result 1614 states and 5960 transitions. [2020-11-09 15:27:28,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:27:28,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-11-09 15:27:28,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:28,771 INFO L225 Difference]: With dead ends: 1614 [2020-11-09 15:27:28,771 INFO L226 Difference]: Without dead ends: 1614 [2020-11-09 15:27:28,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-11-09 15:27:28,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2020-11-09 15:27:28,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1614. [2020-11-09 15:27:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1614 states. [2020-11-09 15:27:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 5960 transitions. [2020-11-09 15:27:28,830 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 5960 transitions. Word has length 14 [2020-11-09 15:27:28,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:28,830 INFO L481 AbstractCegarLoop]: Abstraction has 1614 states and 5960 transitions. [2020-11-09 15:27:28,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:27:28,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 5960 transitions. [2020-11-09 15:27:28,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:27:28,833 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:28,834 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:28,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 15:27:28,834 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-11-09 15:27:28,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:28,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1540603193, now seen corresponding path program 1 times [2020-11-09 15:27:28,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:28,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047616876] [2020-11-09 15:27:28,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:28,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047616876] [2020-11-09 15:27:28,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:28,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:27:28,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1569090210] [2020-11-09 15:27:28,924 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:28,926 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:28,934 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 70 transitions. [2020-11-09 15:27:28,934 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:29,338 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:29,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:27:29,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:29,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:27:29,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:27:29,340 INFO L87 Difference]: Start difference. First operand 1614 states and 5960 transitions. Second operand 5 states. [2020-11-09 15:27:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:29,494 INFO L93 Difference]: Finished difference Result 1786 states and 6562 transitions. [2020-11-09 15:27:29,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 15:27:29,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-09 15:27:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:29,506 INFO L225 Difference]: With dead ends: 1786 [2020-11-09 15:27:29,506 INFO L226 Difference]: Without dead ends: 1786 [2020-11-09 15:27:29,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:27:29,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2020-11-09 15:27:29,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1694. [2020-11-09 15:27:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1694 states. [2020-11-09 15:27:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 6224 transitions. [2020-11-09 15:27:29,569 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 6224 transitions. Word has length 15 [2020-11-09 15:27:29,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:29,569 INFO L481 AbstractCegarLoop]: Abstraction has 1694 states and 6224 transitions. [2020-11-09 15:27:29,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:27:29,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 6224 transitions. [2020-11-09 15:27:29,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:27:29,573 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:29,573 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:29,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 15:27:29,574 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:27:29,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:29,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1541927513, now seen corresponding path program 2 times [2020-11-09 15:27:29,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:29,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112053723] [2020-11-09 15:27:29,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:29,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112053723] [2020-11-09 15:27:29,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:29,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:27:29,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [664202147] [2020-11-09 15:27:29,744 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:29,747 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:29,755 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 92 transitions. [2020-11-09 15:27:29,756 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:29,914 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:27:29,914 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:29,914 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:27:29,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:30,236 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [59115#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (not (= 2 ~z~0)))] [2020-11-09 15:27:30,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 15:27:30,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:30,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 15:27:30,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:27:30,238 INFO L87 Difference]: Start difference. First operand 1694 states and 6224 transitions. Second operand 7 states. [2020-11-09 15:27:30,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:30,430 INFO L93 Difference]: Finished difference Result 1914 states and 6994 transitions. [2020-11-09 15:27:30,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 15:27:30,432 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-11-09 15:27:30,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:30,445 INFO L225 Difference]: With dead ends: 1914 [2020-11-09 15:27:30,445 INFO L226 Difference]: Without dead ends: 1914 [2020-11-09 15:27:30,446 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:27:30,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2020-11-09 15:27:30,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1758. [2020-11-09 15:27:30,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1758 states. [2020-11-09 15:27:30,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 6480 transitions. [2020-11-09 15:27:30,509 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 6480 transitions. Word has length 15 [2020-11-09 15:27:30,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:30,509 INFO L481 AbstractCegarLoop]: Abstraction has 1758 states and 6480 transitions. [2020-11-09 15:27:30,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 15:27:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 6480 transitions. [2020-11-09 15:27:30,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:27:30,513 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:30,513 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:30,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 15:27:30,514 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:27:30,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:30,514 INFO L82 PathProgramCache]: Analyzing trace with hash -218942063, now seen corresponding path program 3 times [2020-11-09 15:27:30,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:30,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941239499] [2020-11-09 15:27:30,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:30,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:30,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941239499] [2020-11-09 15:27:30,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:30,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:27:30,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1370021478] [2020-11-09 15:27:30,837 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:30,840 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:30,847 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 63 transitions. [2020-11-09 15:27:30,847 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:30,890 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 15:27:30,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:30,891 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 15:27:30,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:31,057 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:31,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 15:27:31,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:31,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 15:27:31,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:27:31,059 INFO L87 Difference]: Start difference. First operand 1758 states and 6480 transitions. Second operand 6 states. [2020-11-09 15:27:31,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:31,279 INFO L93 Difference]: Finished difference Result 1922 states and 7060 transitions. [2020-11-09 15:27:31,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:27:31,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-09 15:27:31,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:31,313 INFO L225 Difference]: With dead ends: 1922 [2020-11-09 15:27:31,313 INFO L226 Difference]: Without dead ends: 1922 [2020-11-09 15:27:31,313 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:27:31,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2020-11-09 15:27:31,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1874. [2020-11-09 15:27:31,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2020-11-09 15:27:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 6892 transitions. [2020-11-09 15:27:31,386 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 6892 transitions. Word has length 15 [2020-11-09 15:27:31,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:31,386 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 6892 transitions. [2020-11-09 15:27:31,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 15:27:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 6892 transitions. [2020-11-09 15:27:31,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:27:31,392 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:31,392 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:31,393 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 15:27:31,393 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:27:31,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:31,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2045402096, now seen corresponding path program 1 times [2020-11-09 15:27:31,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:31,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41180410] [2020-11-09 15:27:31,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:31,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:31,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41180410] [2020-11-09 15:27:31,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:31,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:27:31,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2097797767] [2020-11-09 15:27:31,470 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:31,472 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:31,481 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 76 transitions. [2020-11-09 15:27:31,481 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:31,567 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:31,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:31,569 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:31,569 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:31,570 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:31,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:31,609 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:31,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:31,610 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:31,610 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:31,611 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:31,611 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:31,666 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:31,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:31,667 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:31,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:31,668 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:31,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:31,708 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:31,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:31,709 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:31,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:31,710 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:31,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:31,750 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:31,751 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:31,752 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:31,752 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:31,753 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:31,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:31,961 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:31,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:27:31,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:31,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:27:31,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:27:31,963 INFO L87 Difference]: Start difference. First operand 1874 states and 6892 transitions. Second operand 4 states. [2020-11-09 15:27:32,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:32,024 INFO L93 Difference]: Finished difference Result 2642 states and 9428 transitions. [2020-11-09 15:27:32,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:27:32,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-11-09 15:27:32,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:32,035 INFO L225 Difference]: With dead ends: 2642 [2020-11-09 15:27:32,036 INFO L226 Difference]: Without dead ends: 1954 [2020-11-09 15:27:32,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:27:32,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2020-11-09 15:27:32,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1858. [2020-11-09 15:27:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1858 states. [2020-11-09 15:27:32,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 6488 transitions. [2020-11-09 15:27:32,100 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 6488 transitions. Word has length 16 [2020-11-09 15:27:32,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:32,100 INFO L481 AbstractCegarLoop]: Abstraction has 1858 states and 6488 transitions. [2020-11-09 15:27:32,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:27:32,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 6488 transitions. [2020-11-09 15:27:32,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:27:32,105 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:32,105 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:32,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 15:27:32,105 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:27:32,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:32,106 INFO L82 PathProgramCache]: Analyzing trace with hash -591786302, now seen corresponding path program 1 times [2020-11-09 15:27:32,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:32,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043940535] [2020-11-09 15:27:32,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:32,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:32,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043940535] [2020-11-09 15:27:32,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:32,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:27:32,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [10909834] [2020-11-09 15:27:32,195 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:32,197 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:32,208 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 107 transitions. [2020-11-09 15:27:32,208 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:32,255 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:32,255 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:32,256 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:32,256 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:32,257 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:32,257 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:32,375 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:32,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:32,377 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:32,377 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:32,378 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:32,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:32,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:32,466 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:32,478 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:32,479 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:32,479 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:32,480 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:32,480 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:32,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:32,510 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:32,521 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:32,521 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:32,522 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:32,522 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:32,523 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:32,523 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:32,530 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:32,633 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:32,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:32,634 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:32,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:32,635 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:32,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:32,716 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:32,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:32,734 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:32,765 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:32,775 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:32,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:32,797 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:32,798 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:32,799 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:32,799 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:32,799 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:32,800 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:32,840 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:32,841 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:32,841 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:32,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:32,842 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:32,843 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:32,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:32,886 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:32,926 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:32,955 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:33,026 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [76590#(not (= 4 ~__unbuffered_cnt~0))] [2020-11-09 15:27:33,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:27:33,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:33,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:27:33,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:27:33,027 INFO L87 Difference]: Start difference. First operand 1858 states and 6488 transitions. Second operand 5 states. [2020-11-09 15:27:33,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:33,181 INFO L93 Difference]: Finished difference Result 1479 states and 4599 transitions. [2020-11-09 15:27:33,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:27:33,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-09 15:27:33,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:33,187 INFO L225 Difference]: With dead ends: 1479 [2020-11-09 15:27:33,187 INFO L226 Difference]: Without dead ends: 983 [2020-11-09 15:27:33,188 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:27:33,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2020-11-09 15:27:33,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 983. [2020-11-09 15:27:33,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2020-11-09 15:27:33,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 2791 transitions. [2020-11-09 15:27:33,220 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 2791 transitions. Word has length 16 [2020-11-09 15:27:33,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:33,220 INFO L481 AbstractCegarLoop]: Abstraction has 983 states and 2791 transitions. [2020-11-09 15:27:33,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:27:33,220 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 2791 transitions. [2020-11-09 15:27:33,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 15:27:33,223 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:33,223 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:33,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 15:27:33,223 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:27:33,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:33,224 INFO L82 PathProgramCache]: Analyzing trace with hash -232445824, now seen corresponding path program 1 times [2020-11-09 15:27:33,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:33,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006626405] [2020-11-09 15:27:33,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:33,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006626405] [2020-11-09 15:27:33,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:33,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:27:33,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1433153414] [2020-11-09 15:27:33,273 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:33,276 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:33,294 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 130 transitions. [2020-11-09 15:27:33,294 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:33,343 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:33,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:33,345 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:33,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:33,346 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:33,346 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:33,394 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:33,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:33,395 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:33,396 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:33,396 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:33,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:33,446 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:33,446 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:33,447 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:33,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:33,448 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:33,448 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:33,606 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:33,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:27:33,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:33,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:27:33,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:27:33,607 INFO L87 Difference]: Start difference. First operand 983 states and 2791 transitions. Second operand 3 states. [2020-11-09 15:27:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:33,628 INFO L93 Difference]: Finished difference Result 1389 states and 3798 transitions. [2020-11-09 15:27:33,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:27:33,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-11-09 15:27:33,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:33,635 INFO L225 Difference]: With dead ends: 1389 [2020-11-09 15:27:33,635 INFO L226 Difference]: Without dead ends: 993 [2020-11-09 15:27:33,635 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-11-09 15:27:33,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2020-11-09 15:27:33,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 963. [2020-11-09 15:27:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2020-11-09 15:27:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2587 transitions. [2020-11-09 15:27:33,663 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2587 transitions. Word has length 19 [2020-11-09 15:27:33,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:33,663 INFO L481 AbstractCegarLoop]: Abstraction has 963 states and 2587 transitions. [2020-11-09 15:27:33,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:27:33,663 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2587 transitions. [2020-11-09 15:27:33,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 15:27:33,665 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:33,666 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:33,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 15:27:33,666 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:27:33,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:33,666 INFO L82 PathProgramCache]: Analyzing trace with hash 106051531, now seen corresponding path program 1 times [2020-11-09 15:27:33,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:33,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170396451] [2020-11-09 15:27:33,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:33,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170396451] [2020-11-09 15:27:33,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:33,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:27:33,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1601262041] [2020-11-09 15:27:33,795 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:33,798 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:33,813 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 102 transitions. [2020-11-09 15:27:33,813 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:33,831 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:33,832 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:33,832 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:33,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:33,833 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:33,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:33,905 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:33,905 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:33,906 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:33,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:33,907 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:33,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,004 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:34,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,005 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:34,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,006 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:34,006 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,111 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:27:34,125 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [83364#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 15:27:34,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 15:27:34,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:34,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 15:27:34,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:27:34,126 INFO L87 Difference]: Start difference. First operand 963 states and 2587 transitions. Second operand 7 states. [2020-11-09 15:27:34,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:34,244 INFO L93 Difference]: Finished difference Result 846 states and 2223 transitions. [2020-11-09 15:27:34,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:27:34,246 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-11-09 15:27:34,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:34,249 INFO L225 Difference]: With dead ends: 846 [2020-11-09 15:27:34,249 INFO L226 Difference]: Without dead ends: 678 [2020-11-09 15:27:34,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-09 15:27:34,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2020-11-09 15:27:34,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 618. [2020-11-09 15:27:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2020-11-09 15:27:34,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 1602 transitions. [2020-11-09 15:27:34,266 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 1602 transitions. Word has length 19 [2020-11-09 15:27:34,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:34,266 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 1602 transitions. [2020-11-09 15:27:34,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 15:27:34,266 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1602 transitions. [2020-11-09 15:27:34,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 15:27:34,268 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:34,268 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:34,268 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-09 15:27:34,268 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:27:34,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:34,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1372551299, now seen corresponding path program 1 times [2020-11-09 15:27:34,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:34,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088883741] [2020-11-09 15:27:34,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:34,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:34,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088883741] [2020-11-09 15:27:34,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:34,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:27:34,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [529901648] [2020-11-09 15:27:34,325 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:34,329 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:34,393 INFO L252 McrAutomatonBuilder]: Finished intersection with 179 states and 404 transitions. [2020-11-09 15:27:34,393 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:34,402 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:34,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,403 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:34,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,404 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:34,404 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,447 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:34,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,448 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:34,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,449 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:34,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,500 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:34,500 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,501 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:34,501 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,501 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:34,502 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,637 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:34,638 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,639 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:34,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,639 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:34,640 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,678 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:34,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,679 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:34,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,680 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:34,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,719 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:34,720 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,720 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:34,721 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,721 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:34,722 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,763 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:34,764 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,765 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:34,765 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,766 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:34,766 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,809 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:34,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,810 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:34,810 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:34,811 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:34,811 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:35,255 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:35,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:27:35,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:35,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:27:35,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:27:35,257 INFO L87 Difference]: Start difference. First operand 618 states and 1602 transitions. Second operand 4 states. [2020-11-09 15:27:35,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:35,292 INFO L93 Difference]: Finished difference Result 823 states and 2076 transitions. [2020-11-09 15:27:35,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:27:35,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-11-09 15:27:35,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:35,296 INFO L225 Difference]: With dead ends: 823 [2020-11-09 15:27:35,297 INFO L226 Difference]: Without dead ends: 445 [2020-11-09 15:27:35,298 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:27:35,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-11-09 15:27:35,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 442. [2020-11-09 15:27:35,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-11-09 15:27:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1029 transitions. [2020-11-09 15:27:35,309 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1029 transitions. Word has length 22 [2020-11-09 15:27:35,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:35,309 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 1029 transitions. [2020-11-09 15:27:35,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:27:35,310 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1029 transitions. [2020-11-09 15:27:35,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 15:27:35,315 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:35,315 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:35,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-09 15:27:35,315 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:27:35,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:35,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1722088816, now seen corresponding path program 1 times [2020-11-09 15:27:35,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:35,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708162493] [2020-11-09 15:27:35,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:35,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708162493] [2020-11-09 15:27:35,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:35,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:27:35,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [69982] [2020-11-09 15:27:35,664 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:35,667 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:35,727 INFO L252 McrAutomatonBuilder]: Finished intersection with 209 states and 484 transitions. [2020-11-09 15:27:35,727 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:35,736 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:27:35,736 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:35,737 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:27:35,737 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:35,747 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:35,748 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:35,749 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 4, 1] term [2020-11-09 15:27:35,749 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:27:35,750 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:27:35,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:36,244 WARN L194 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 20 [2020-11-09 15:27:36,471 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:27:36,471 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:36,472 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:27:36,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:36,477 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:36,477 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:36,478 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 4, 1] term [2020-11-09 15:27:36,478 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:27:36,479 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:27:36,480 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:37,508 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [87169#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (or (= (mod ~z$w_buff0_used~0 256) 0) (= (mod ~z$r_buff0_thd3~0 256) 0)) (= ~z$w_buff0~0 2)), 87171#(and (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= 2 ~z~0))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (= ~z$w_buff0_used~0 0)) (or (= ~z$r_buff0_thd0~0 0) (not (= (mod ~z$w_buff0_used~0 256) 0))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (= ~z$r_buff0_thd3~0 0))), 87170#(and (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (= (mod ~z$r_buff0_thd3~0 256) 0)) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= 2 ~z~0))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (= ~z$w_buff0_used~0 0)) (or (= ~z$r_buff0_thd0~0 0) (not (= (mod ~z$w_buff0_used~0 256) 0)))), 87173#(and (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (= (mod ~z$r_buff0_thd3~0 256) 0)) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (= ~z$w_buff0_used~0 0)) (or (= ~z$r_buff0_thd0~0 0) (not (= (mod ~z$w_buff0_used~0 256) 0)))), 87172#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (or (= (mod ~z$w_buff0_used~0 256) 0) (= (mod ~z$r_buff0_thd3~0 256) 0)) (= ~z$w_buff0~0 2)), 87174#(and (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (= ~z$w_buff0_used~0 0)) (or (= ~z$r_buff0_thd0~0 0) (not (= (mod ~z$w_buff0_used~0 256) 0))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (= ~z$r_buff0_thd3~0 0)))] [2020-11-09 15:27:37,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-09 15:27:37,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:37,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-09 15:27:37,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-11-09 15:27:37,510 INFO L87 Difference]: Start difference. First operand 442 states and 1029 transitions. Second operand 13 states. [2020-11-09 15:27:37,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:37,930 INFO L93 Difference]: Finished difference Result 537 states and 1219 transitions. [2020-11-09 15:27:37,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:27:37,932 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-11-09 15:27:37,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:37,933 INFO L225 Difference]: With dead ends: 537 [2020-11-09 15:27:37,933 INFO L226 Difference]: Without dead ends: 299 [2020-11-09 15:27:37,934 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 11 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2020-11-09 15:27:37,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-11-09 15:27:37,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2020-11-09 15:27:37,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-11-09 15:27:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 646 transitions. [2020-11-09 15:27:37,940 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 646 transitions. Word has length 22 [2020-11-09 15:27:37,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:37,940 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 646 transitions. [2020-11-09 15:27:37,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-09 15:27:37,941 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 646 transitions. [2020-11-09 15:27:37,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 15:27:37,942 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:37,942 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:37,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-09 15:27:37,942 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:27:37,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:37,943 INFO L82 PathProgramCache]: Analyzing trace with hash -2144444351, now seen corresponding path program 1 times [2020-11-09 15:27:37,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:37,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575389097] [2020-11-09 15:27:37,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:38,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575389097] [2020-11-09 15:27:38,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:38,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 15:27:38,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1416276945] [2020-11-09 15:27:38,067 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:38,071 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:38,091 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 126 transitions. [2020-11-09 15:27:38,091 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:38,096 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:38,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:38,097 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:38,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:38,098 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:38,098 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:38,256 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [88317#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 15:27:38,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 15:27:38,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:38,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 15:27:38,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-09 15:27:38,257 INFO L87 Difference]: Start difference. First operand 296 states and 646 transitions. Second operand 8 states. [2020-11-09 15:27:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:38,397 INFO L93 Difference]: Finished difference Result 276 states and 607 transitions. [2020-11-09 15:27:38,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 15:27:38,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-11-09 15:27:38,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:38,400 INFO L225 Difference]: With dead ends: 276 [2020-11-09 15:27:38,400 INFO L226 Difference]: Without dead ends: 63 [2020-11-09 15:27:38,401 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 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-11-09 15:27:38,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-11-09 15:27:38,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-11-09 15:27:38,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-09 15:27:38,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 121 transitions. [2020-11-09 15:27:38,403 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 121 transitions. Word has length 22 [2020-11-09 15:27:38,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:38,403 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 121 transitions. [2020-11-09 15:27:38,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 15:27:38,403 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 121 transitions. [2020-11-09 15:27:38,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-09 15:27:38,404 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:38,404 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] [2020-11-09 15:27:38,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-09 15:27:38,404 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:27:38,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:38,405 INFO L82 PathProgramCache]: Analyzing trace with hash 81887815, now seen corresponding path program 1 times [2020-11-09 15:27:38,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:38,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665475286] [2020-11-09 15:27:38,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:27:38,444 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:27:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:27:38,520 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:27:38,588 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 15:27:38,588 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 15:27:38,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-09 15:27:38,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 03:27:38 BasicIcfg [2020-11-09 15:27:38,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 15:27:38,768 INFO L168 Benchmark]: Toolchain (without parser) took 63376.60 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 124.5 MB in the beginning and 97.3 MB in the end (delta: 27.2 MB). Peak memory consumption was 191.2 MB. Max. memory is 8.0 GB. [2020-11-09 15:27:38,769 INFO L168 Benchmark]: CDTParser took 0.87 ms. Allocated memory is still 151.0 MB. Free memory was 123.7 MB in the beginning and 123.6 MB in the end (delta: 84.5 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 15:27:38,769 INFO L168 Benchmark]: CACSL2BoogieTranslator took 900.45 ms. Allocated memory is still 151.0 MB. Free memory was 123.8 MB in the beginning and 121.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 28.8 MB. Max. memory is 8.0 GB. [2020-11-09 15:27:38,770 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.81 ms. Allocated memory is still 151.0 MB. Free memory was 121.2 MB in the beginning and 118.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:27:38,770 INFO L168 Benchmark]: Boogie Preprocessor took 48.67 ms. Allocated memory is still 151.0 MB. Free memory was 118.1 MB in the beginning and 116.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:27:38,771 INFO L168 Benchmark]: RCFGBuilder took 2805.94 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 116.0 MB in the beginning and 91.4 MB in the end (delta: 24.6 MB). Peak memory consumption was 78.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:27:38,771 INFO L168 Benchmark]: TraceAbstraction took 59476.04 ms. Allocated memory was 181.4 MB in the beginning and 314.6 MB in the end (delta: 133.2 MB). Free memory was 90.9 MB in the beginning and 97.3 MB in the end (delta: -6.4 MB). Peak memory consumption was 126.2 MB. Max. memory is 8.0 GB. [2020-11-09 15:27:38,780 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.87 ms. Allocated memory is still 151.0 MB. Free memory was 123.7 MB in the beginning and 123.6 MB in the end (delta: 84.5 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 900.45 ms. Allocated memory is still 151.0 MB. Free memory was 123.8 MB in the beginning and 121.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 28.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 130.81 ms. Allocated memory is still 151.0 MB. Free memory was 121.2 MB in the beginning and 118.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 48.67 ms. Allocated memory is still 151.0 MB. Free memory was 118.1 MB in the beginning and 116.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2805.94 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 116.0 MB in the beginning and 91.4 MB in the end (delta: 24.6 MB). Peak memory consumption was 78.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 59476.04 ms. Allocated memory was 181.4 MB in the beginning and 314.6 MB in the end (delta: 133.2 MB). Free memory was 90.9 MB in the beginning and 97.3 MB in the end (delta: -6.4 MB). Peak memory consumption was 126.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1396 VarBasedMoverChecksPositive, 50 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 105 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 44.0s, 126 PlacesBefore, 44 PlacesAfterwards, 116 TransitionsBefore, 31 TransitionsAfterwards, 2622 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 103 TotalNumberOfCompositions, 7247 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1537; [L835] FCALL, FORK 0 pthread_create(&t1537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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] [L836] 0 pthread_t t1538; [L837] FCALL, FORK 0 pthread_create(&t1538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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] [L838] 0 pthread_t t1539; [L839] FCALL, FORK 0 pthread_create(&t1539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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] [L840] 0 pthread_t t1540; [L841] FCALL, FORK 0 pthread_create(&t1540, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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=0, weak$$choice2=0, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L761] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=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=0, weak$$choice2=0, x=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=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=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=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=0, weak$$choice2=0, x=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=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=0, weak$$choice2=0, x=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 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) [L812] 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) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 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 [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 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 [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix057_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=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=50, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 59.1s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 44.3s, HoareTripleCheckerStatistics: 571 SDtfs, 631 SDslu, 812 SDs, 0 SdLazy, 361 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 518 GetRequests, 411 SyntacticMatches, 38 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred 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: 1.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 712 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 30119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...