/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-12 17:24:28,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-12 17:24:28,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-12 17:24:28,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-12 17:24:28,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-12 17:24:28,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-12 17:24:28,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-12 17:24:28,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-12 17:24:28,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-12 17:24:28,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-12 17:24:28,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-12 17:24:28,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-12 17:24:28,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-12 17:24:28,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-12 17:24:28,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-12 17:24:28,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-12 17:24:28,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-12 17:24:28,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-12 17:24:28,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-12 17:24:28,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-12 17:24:28,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-12 17:24:28,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-12 17:24:28,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-12 17:24:28,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-12 17:24:28,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-12 17:24:28,746 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-12 17:24:28,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-12 17:24:28,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-12 17:24:28,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-12 17:24:28,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-12 17:24:28,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-12 17:24:28,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-12 17:24:28,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-12 17:24:28,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-12 17:24:28,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-12 17:24:28,750 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-12 17:24:28,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-12 17:24:28,751 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-12 17:24:28,751 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-12 17:24:28,752 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-12 17:24:28,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-12 17:24:28,762 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-08-12 17:24:28,799 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-12 17:24:28,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-12 17:24:28,799 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-12 17:24:28,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-12 17:24:28,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-12 17:24:28,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-12 17:24:28,803 INFO L138 SettingsManager]: * Use SBE=true [2021-08-12 17:24:28,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-12 17:24:28,803 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-12 17:24:28,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-12 17:24:28,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-12 17:24:28,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-12 17:24:28,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-12 17:24:28,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-12 17:24:28,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-12 17:24:28,805 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-12 17:24:28,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-12 17:24:28,805 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-12 17:24:28,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-12 17:24:28,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-12 17:24:28,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-12 17:24:28,805 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-12 17:24:28,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-12 17:24:28,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-12 17:24:28,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-12 17:24:28,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-12 17:24:28,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-12 17:24:28,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-12 17:24:28,807 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-12 17:24:28,807 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-12 17:24:28,807 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2021-08-12 17:24:29,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-12 17:24:29,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-12 17:24:29,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-12 17:24:29,113 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-12 17:24:29,113 INFO L275 PluginConnector]: CDTParser initialized [2021-08-12 17:24:29,114 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_rmo.oepc.i [2021-08-12 17:24:29,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05d699fe9/f429d4afcde946e98d98e0c5ce11ba3c/FLAG3f17b4abc [2021-08-12 17:24:29,824 INFO L306 CDTParser]: Found 1 translation units. [2021-08-12 17:24:29,826 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_rmo.oepc.i [2021-08-12 17:24:29,841 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05d699fe9/f429d4afcde946e98d98e0c5ce11ba3c/FLAG3f17b4abc [2021-08-12 17:24:30,158 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05d699fe9/f429d4afcde946e98d98e0c5ce11ba3c [2021-08-12 17:24:30,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-12 17:24:30,162 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-12 17:24:30,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-12 17:24:30,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-12 17:24:30,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-12 17:24:30,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 05:24:30" (1/1) ... [2021-08-12 17:24:30,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ea46fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:24:30, skipping insertion in model container [2021-08-12 17:24:30,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 05:24:30" (1/1) ... [2021-08-12 17:24:30,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-12 17:24:30,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-12 17:24:30,371 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_rmo.oepc.i[950,963] [2021-08-12 17:24:30,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 17:24:30,546 INFO L203 MainTranslator]: Completed pre-run [2021-08-12 17:24:30,563 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_rmo.oepc.i[950,963] [2021-08-12 17:24:30,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 17:24:30,674 INFO L208 MainTranslator]: Completed translation [2021-08-12 17:24:30,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:24:30 WrapperNode [2021-08-12 17:24:30,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-12 17:24:30,676 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-12 17:24:30,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-12 17:24:30,676 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-12 17:24:30,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:24:30" (1/1) ... [2021-08-12 17:24:30,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:24:30" (1/1) ... [2021-08-12 17:24:30,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-12 17:24:30,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-12 17:24:30,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-12 17:24:30,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-12 17:24:30,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:24:30" (1/1) ... [2021-08-12 17:24:30,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:24:30" (1/1) ... [2021-08-12 17:24:30,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:24:30" (1/1) ... [2021-08-12 17:24:30,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:24:30" (1/1) ... [2021-08-12 17:24:30,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:24:30" (1/1) ... [2021-08-12 17:24:30,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:24:30" (1/1) ... [2021-08-12 17:24:30,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:24:30" (1/1) ... [2021-08-12 17:24:30,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-12 17:24:30,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-12 17:24:30,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-12 17:24:30,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-12 17:24:30,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:24:30" (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 [2021-08-12 17:24:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-12 17:24:30,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-12 17:24:30,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-12 17:24:30,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-12 17:24:30,822 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-12 17:24:30,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-12 17:24:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-12 17:24:30,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-12 17:24:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-12 17:24:30,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-12 17:24:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-12 17:24:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-12 17:24:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-12 17:24:30,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-12 17:24:30,825 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-12 17:24:32,547 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-12 17:24:32,548 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-12 17:24:32,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 05:24:32 BoogieIcfgContainer [2021-08-12 17:24:32,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-12 17:24:32,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-12 17:24:32,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-12 17:24:32,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-12 17:24:32,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.08 05:24:30" (1/3) ... [2021-08-12 17:24:32,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f72fbbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 05:24:32, skipping insertion in model container [2021-08-12 17:24:32,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:24:30" (2/3) ... [2021-08-12 17:24:32,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f72fbbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 05:24:32, skipping insertion in model container [2021-08-12 17:24:32,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 05:24:32" (3/3) ... [2021-08-12 17:24:32,557 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_rmo.oepc.i [2021-08-12 17:24:32,563 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-12 17:24:32,563 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-12 17:24:32,563 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-12 17:24:32,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,598 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,598 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,598 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,599 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,599 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,599 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,599 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,600 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,604 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,605 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,605 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,605 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,609 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,609 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,609 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,609 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,613 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,614 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,616 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,617 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,619 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,620 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,620 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:24:32,621 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-12 17:24:32,637 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-12 17:24:32,650 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-12 17:24:32,650 INFO L379 AbstractCegarLoop]: Hoare is true [2021-08-12 17:24:32,650 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-12 17:24:32,650 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-12 17:24:32,651 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-12 17:24:32,651 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-12 17:24:32,651 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-12 17:24:32,651 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-12 17:24:32,659 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 104 transitions, 223 flow [2021-08-12 17:24:33,517 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14150 states, 14146 states have (on average 3.615651067439559) internal successors, (51147), 14149 states have internal predecessors, (51147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:33,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 14150 states, 14146 states have (on average 3.615651067439559) internal successors, (51147), 14149 states have internal predecessors, (51147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:33,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-12 17:24:33,584 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:24:33,584 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:24:33,585 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:24:33,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:24:33,589 INFO L82 PathProgramCache]: Analyzing trace with hash -857883359, now seen corresponding path program 1 times [2021-08-12 17:24:33,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:24:33,596 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888275520] [2021-08-12 17:24:33,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:24:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:24:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:24:33,878 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:24:33,879 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888275520] [2021-08-12 17:24:33,880 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888275520] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:24:33,880 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:24:33,880 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-12 17:24:33,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837827530] [2021-08-12 17:24:33,884 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-12 17:24:33,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:24:33,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-12 17:24:33,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 17:24:33,930 INFO L87 Difference]: Start difference. First operand has 14150 states, 14146 states have (on average 3.615651067439559) internal successors, (51147), 14149 states have internal predecessors, (51147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:34,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:24:34,595 INFO L93 Difference]: Finished difference Result 22214 states and 81243 transitions. [2021-08-12 17:24:34,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-12 17:24:34,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-08-12 17:24:34,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:24:34,696 INFO L225 Difference]: With dead ends: 22214 [2021-08-12 17:24:34,696 INFO L226 Difference]: Without dead ends: 7206 [2021-08-12 17:24:34,724 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 17:24:34,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7206 states. [2021-08-12 17:24:35,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7206 to 7206. [2021-08-12 17:24:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7206 states, 7205 states have (on average 3.470645385149202) internal successors, (25006), 7205 states have internal predecessors, (25006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7206 states to 7206 states and 25006 transitions. [2021-08-12 17:24:35,177 INFO L78 Accepts]: Start accepts. Automaton has 7206 states and 25006 transitions. Word has length 40 [2021-08-12 17:24:35,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:24:35,178 INFO L482 AbstractCegarLoop]: Abstraction has 7206 states and 25006 transitions. [2021-08-12 17:24:35,178 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:35,179 INFO L276 IsEmpty]: Start isEmpty. Operand 7206 states and 25006 transitions. [2021-08-12 17:24:35,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-12 17:24:35,191 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:24:35,191 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:24:35,192 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-12 17:24:35,192 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:24:35,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:24:35,193 INFO L82 PathProgramCache]: Analyzing trace with hash -247046329, now seen corresponding path program 1 times [2021-08-12 17:24:35,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:24:35,193 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945722919] [2021-08-12 17:24:35,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:24:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:24:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:24:35,456 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:24:35,456 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945722919] [2021-08-12 17:24:35,456 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945722919] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:24:35,457 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:24:35,457 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:24:35,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696116972] [2021-08-12 17:24:35,459 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:24:35,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:24:35,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:24:35,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:24:35,461 INFO L87 Difference]: Start difference. First operand 7206 states and 25006 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:24:35,881 INFO L93 Difference]: Finished difference Result 9606 states and 33186 transitions. [2021-08-12 17:24:35,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:24:35,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-08-12 17:24:35,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:24:35,966 INFO L225 Difference]: With dead ends: 9606 [2021-08-12 17:24:35,966 INFO L226 Difference]: Without dead ends: 6918 [2021-08-12 17:24:35,978 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 84.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:24:36,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6918 states. [2021-08-12 17:24:36,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6918 to 6918. [2021-08-12 17:24:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6918 states, 6917 states have (on average 3.453809454966026) internal successors, (23890), 6917 states have internal predecessors, (23890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6918 states to 6918 states and 23890 transitions. [2021-08-12 17:24:36,249 INFO L78 Accepts]: Start accepts. Automaton has 6918 states and 23890 transitions. Word has length 66 [2021-08-12 17:24:36,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:24:36,251 INFO L482 AbstractCegarLoop]: Abstraction has 6918 states and 23890 transitions. [2021-08-12 17:24:36,251 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 6918 states and 23890 transitions. [2021-08-12 17:24:36,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-12 17:24:36,306 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:24:36,306 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:24:36,306 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-12 17:24:36,306 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:24:36,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:24:36,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1162610406, now seen corresponding path program 1 times [2021-08-12 17:24:36,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:24:36,307 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947816952] [2021-08-12 17:24:36,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:24:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:24:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:24:36,539 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:24:36,539 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947816952] [2021-08-12 17:24:36,540 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947816952] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:24:36,540 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:24:36,540 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-12 17:24:36,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070971743] [2021-08-12 17:24:36,547 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-12 17:24:36,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:24:36,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-12 17:24:36,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-12 17:24:36,555 INFO L87 Difference]: Start difference. First operand 6918 states and 23890 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:37,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:24:37,107 INFO L93 Difference]: Finished difference Result 9044 states and 31122 transitions. [2021-08-12 17:24:37,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-12 17:24:37,109 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-08-12 17:24:37,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:24:37,153 INFO L225 Difference]: With dead ends: 9044 [2021-08-12 17:24:37,153 INFO L226 Difference]: Without dead ends: 7028 [2021-08-12 17:24:37,162 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 192.6ms TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-08-12 17:24:37,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7028 states. [2021-08-12 17:24:37,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7028 to 6738. [2021-08-12 17:24:37,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6738 states, 6737 states have (on average 3.4445598931275048) internal successors, (23206), 6737 states have internal predecessors, (23206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:37,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6738 states to 6738 states and 23206 transitions. [2021-08-12 17:24:37,485 INFO L78 Accepts]: Start accepts. Automaton has 6738 states and 23206 transitions. Word has length 68 [2021-08-12 17:24:37,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:24:37,486 INFO L482 AbstractCegarLoop]: Abstraction has 6738 states and 23206 transitions. [2021-08-12 17:24:37,486 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 6738 states and 23206 transitions. [2021-08-12 17:24:37,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-12 17:24:37,498 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:24:37,498 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:24:37,498 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-12 17:24:37,498 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:24:37,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:24:37,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1230124920, now seen corresponding path program 1 times [2021-08-12 17:24:37,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:24:37,499 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047197947] [2021-08-12 17:24:37,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:24:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:24:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:24:37,674 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:24:37,674 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047197947] [2021-08-12 17:24:37,674 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047197947] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:24:37,674 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:24:37,674 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:24:37,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404911124] [2021-08-12 17:24:37,675 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:24:37,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:24:37,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:24:37,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:24:37,676 INFO L87 Difference]: Start difference. First operand 6738 states and 23206 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:38,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:24:38,062 INFO L93 Difference]: Finished difference Result 11913 states and 40636 transitions. [2021-08-12 17:24:38,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:24:38,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-08-12 17:24:38,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:24:38,111 INFO L225 Difference]: With dead ends: 11913 [2021-08-12 17:24:38,111 INFO L226 Difference]: Without dead ends: 7458 [2021-08-12 17:24:38,124 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 95.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:24:38,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7458 states. [2021-08-12 17:24:38,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7458 to 6258. [2021-08-12 17:24:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6258 states, 6257 states have (on average 3.3637525970912576) internal successors, (21047), 6257 states have internal predecessors, (21047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:38,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6258 states to 6258 states and 21047 transitions. [2021-08-12 17:24:38,378 INFO L78 Accepts]: Start accepts. Automaton has 6258 states and 21047 transitions. Word has length 69 [2021-08-12 17:24:38,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:24:38,379 INFO L482 AbstractCegarLoop]: Abstraction has 6258 states and 21047 transitions. [2021-08-12 17:24:38,379 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:38,380 INFO L276 IsEmpty]: Start isEmpty. Operand 6258 states and 21047 transitions. [2021-08-12 17:24:38,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-12 17:24:38,391 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:24:38,392 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:24:38,393 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-12 17:24:38,393 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:24:38,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:24:38,393 INFO L82 PathProgramCache]: Analyzing trace with hash 846349672, now seen corresponding path program 1 times [2021-08-12 17:24:38,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:24:38,397 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176060009] [2021-08-12 17:24:38,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:24:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:24:38,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:24:38,679 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:24:38,680 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176060009] [2021-08-12 17:24:38,680 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176060009] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:24:38,680 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:24:38,680 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-12 17:24:38,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391841520] [2021-08-12 17:24:38,685 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-12 17:24:38,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:24:38,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-12 17:24:38,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-12 17:24:38,686 INFO L87 Difference]: Start difference. First operand 6258 states and 21047 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:39,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:24:39,027 INFO L93 Difference]: Finished difference Result 7662 states and 25721 transitions. [2021-08-12 17:24:39,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-12 17:24:39,028 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-08-12 17:24:39,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:24:39,063 INFO L225 Difference]: With dead ends: 7662 [2021-08-12 17:24:39,064 INFO L226 Difference]: Without dead ends: 6222 [2021-08-12 17:24:39,069 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 150.1ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-08-12 17:24:39,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6222 states. [2021-08-12 17:24:39,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6222 to 6222. [2021-08-12 17:24:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6222 states, 6221 states have (on average 3.360070728178749) internal successors, (20903), 6221 states have internal predecessors, (20903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 20903 transitions. [2021-08-12 17:24:39,251 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 20903 transitions. Word has length 70 [2021-08-12 17:24:39,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:24:39,252 INFO L482 AbstractCegarLoop]: Abstraction has 6222 states and 20903 transitions. [2021-08-12 17:24:39,252 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 20903 transitions. [2021-08-12 17:24:39,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-12 17:24:39,264 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:24:39,264 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:24:39,264 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-12 17:24:39,264 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:24:39,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:24:39,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1359917548, now seen corresponding path program 1 times [2021-08-12 17:24:39,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:24:39,265 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143014920] [2021-08-12 17:24:39,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:24:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:24:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:24:39,401 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:24:39,402 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143014920] [2021-08-12 17:24:39,402 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143014920] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:24:39,402 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:24:39,402 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:24:39,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586102176] [2021-08-12 17:24:39,403 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:24:39,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:24:39,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:24:39,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:24:39,404 INFO L87 Difference]: Start difference. First operand 6222 states and 20903 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:39,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:24:39,628 INFO L93 Difference]: Finished difference Result 7230 states and 24203 transitions. [2021-08-12 17:24:39,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:24:39,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-08-12 17:24:39,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:24:39,669 INFO L225 Difference]: With dead ends: 7230 [2021-08-12 17:24:39,670 INFO L226 Difference]: Without dead ends: 5886 [2021-08-12 17:24:39,676 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 94.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:24:39,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5886 states. [2021-08-12 17:24:39,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5886 to 5886. [2021-08-12 17:24:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5886 states, 5885 states have (on average 3.345964316057774) internal successors, (19691), 5885 states have internal predecessors, (19691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5886 states to 5886 states and 19691 transitions. [2021-08-12 17:24:39,878 INFO L78 Accepts]: Start accepts. Automaton has 5886 states and 19691 transitions. Word has length 71 [2021-08-12 17:24:39,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:24:39,878 INFO L482 AbstractCegarLoop]: Abstraction has 5886 states and 19691 transitions. [2021-08-12 17:24:39,878 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 5886 states and 19691 transitions. [2021-08-12 17:24:39,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-12 17:24:39,892 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:24:39,892 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:24:39,893 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-12 17:24:39,893 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:24:39,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:24:39,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1168582365, now seen corresponding path program 1 times [2021-08-12 17:24:39,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:24:39,896 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3095448] [2021-08-12 17:24:39,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:24:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:24:40,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:24:40,077 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:24:40,077 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3095448] [2021-08-12 17:24:40,077 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3095448] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:24:40,077 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:24:40,077 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-12 17:24:40,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887718337] [2021-08-12 17:24:40,078 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-12 17:24:40,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:24:40,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-12 17:24:40,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-12 17:24:40,079 INFO L87 Difference]: Start difference. First operand 5886 states and 19691 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:24:40,626 INFO L93 Difference]: Finished difference Result 7770 states and 26076 transitions. [2021-08-12 17:24:40,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-12 17:24:40,627 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-08-12 17:24:40,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:24:40,669 INFO L225 Difference]: With dead ends: 7770 [2021-08-12 17:24:40,669 INFO L226 Difference]: Without dead ends: 6426 [2021-08-12 17:24:40,675 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 247.1ms TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2021-08-12 17:24:40,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6426 states. [2021-08-12 17:24:40,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6426 to 6258. [2021-08-12 17:24:40,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6258 states, 6257 states have (on average 3.3504874540514624) internal successors, (20964), 6257 states have internal predecessors, (20964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6258 states to 6258 states and 20964 transitions. [2021-08-12 17:24:40,963 INFO L78 Accepts]: Start accepts. Automaton has 6258 states and 20964 transitions. Word has length 71 [2021-08-12 17:24:40,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:24:40,963 INFO L482 AbstractCegarLoop]: Abstraction has 6258 states and 20964 transitions. [2021-08-12 17:24:40,963 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 6258 states and 20964 transitions. [2021-08-12 17:24:40,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-12 17:24:40,979 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:24:40,979 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:24:40,979 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-12 17:24:40,979 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:24:40,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:24:40,980 INFO L82 PathProgramCache]: Analyzing trace with hash -49760948, now seen corresponding path program 1 times [2021-08-12 17:24:40,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:24:40,980 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358475918] [2021-08-12 17:24:40,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:24:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:24:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:24:41,165 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:24:41,165 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358475918] [2021-08-12 17:24:41,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358475918] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:24:41,165 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:24:41,166 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-12 17:24:41,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194588731] [2021-08-12 17:24:41,166 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-12 17:24:41,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:24:41,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-12 17:24:41,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-12 17:24:41,167 INFO L87 Difference]: Start difference. First operand 6258 states and 20964 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:41,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:24:41,686 INFO L93 Difference]: Finished difference Result 7136 states and 23812 transitions. [2021-08-12 17:24:41,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 17:24:41,687 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-08-12 17:24:41,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:24:41,725 INFO L225 Difference]: With dead ends: 7136 [2021-08-12 17:24:41,725 INFO L226 Difference]: Without dead ends: 5984 [2021-08-12 17:24:41,731 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 190.1ms TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2021-08-12 17:24:41,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2021-08-12 17:24:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 5970. [2021-08-12 17:24:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5970 states, 5969 states have (on average 3.3392528061651867) internal successors, (19932), 5969 states have internal predecessors, (19932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5970 states to 5970 states and 19932 transitions. [2021-08-12 17:24:41,929 INFO L78 Accepts]: Start accepts. Automaton has 5970 states and 19932 transitions. Word has length 72 [2021-08-12 17:24:41,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:24:41,930 INFO L482 AbstractCegarLoop]: Abstraction has 5970 states and 19932 transitions. [2021-08-12 17:24:41,930 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:41,930 INFO L276 IsEmpty]: Start isEmpty. Operand 5970 states and 19932 transitions. [2021-08-12 17:24:41,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-12 17:24:41,942 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:24:41,942 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:24:41,942 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-12 17:24:41,942 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:24:41,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:24:41,943 INFO L82 PathProgramCache]: Analyzing trace with hash -485189295, now seen corresponding path program 1 times [2021-08-12 17:24:41,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:24:41,943 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588500559] [2021-08-12 17:24:41,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:24:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:24:42,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:24:42,141 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:24:42,142 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588500559] [2021-08-12 17:24:42,142 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588500559] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:24:42,142 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:24:42,142 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-12 17:24:42,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046989832] [2021-08-12 17:24:42,142 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-12 17:24:42,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:24:42,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-12 17:24:42,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-08-12 17:24:42,143 INFO L87 Difference]: Start difference. First operand 5970 states and 19932 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:24:42,578 INFO L93 Difference]: Finished difference Result 6786 states and 22568 transitions. [2021-08-12 17:24:42,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-12 17:24:42,578 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-08-12 17:24:42,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:24:42,606 INFO L225 Difference]: With dead ends: 6786 [2021-08-12 17:24:42,606 INFO L226 Difference]: Without dead ends: 5922 [2021-08-12 17:24:42,609 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 189.3ms TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-08-12 17:24:42,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5922 states. [2021-08-12 17:24:42,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5922 to 5922. [2021-08-12 17:24:42,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5922 states, 5921 states have (on average 3.335922985982098) internal successors, (19752), 5921 states have internal predecessors, (19752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:42,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5922 states to 5922 states and 19752 transitions. [2021-08-12 17:24:42,790 INFO L78 Accepts]: Start accepts. Automaton has 5922 states and 19752 transitions. Word has length 73 [2021-08-12 17:24:42,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:24:42,791 INFO L482 AbstractCegarLoop]: Abstraction has 5922 states and 19752 transitions. [2021-08-12 17:24:42,791 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:42,791 INFO L276 IsEmpty]: Start isEmpty. Operand 5922 states and 19752 transitions. [2021-08-12 17:24:42,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-12 17:24:42,802 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:24:42,803 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:24:42,803 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-12 17:24:42,803 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:24:42,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:24:42,803 INFO L82 PathProgramCache]: Analyzing trace with hash 133115822, now seen corresponding path program 1 times [2021-08-12 17:24:42,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:24:42,804 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3554800] [2021-08-12 17:24:42,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:24:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:24:42,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:24:42,889 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:24:42,889 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3554800] [2021-08-12 17:24:42,889 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3554800] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:24:42,889 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:24:42,889 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:24:42,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755740709] [2021-08-12 17:24:42,889 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:24:42,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:24:42,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:24:42,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:24:42,890 INFO L87 Difference]: Start difference. First operand 5922 states and 19752 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:43,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:24:43,242 INFO L93 Difference]: Finished difference Result 9162 states and 30420 transitions. [2021-08-12 17:24:43,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:24:43,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-08-12 17:24:43,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:24:43,278 INFO L225 Difference]: With dead ends: 9162 [2021-08-12 17:24:43,279 INFO L226 Difference]: Without dead ends: 5202 [2021-08-12 17:24:43,289 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 93.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:24:43,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5202 states. [2021-08-12 17:24:43,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5202 to 5202. [2021-08-12 17:24:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5202 states, 5201 states have (on average 3.2566814074216497) internal successors, (16938), 5201 states have internal predecessors, (16938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:43,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5202 states to 5202 states and 16938 transitions. [2021-08-12 17:24:43,482 INFO L78 Accepts]: Start accepts. Automaton has 5202 states and 16938 transitions. Word has length 74 [2021-08-12 17:24:43,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:24:43,483 INFO L482 AbstractCegarLoop]: Abstraction has 5202 states and 16938 transitions. [2021-08-12 17:24:43,483 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:43,483 INFO L276 IsEmpty]: Start isEmpty. Operand 5202 states and 16938 transitions. [2021-08-12 17:24:43,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-12 17:24:43,493 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:24:43,493 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:24:43,493 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-12 17:24:43,493 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:24:43,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:24:43,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1379749443, now seen corresponding path program 1 times [2021-08-12 17:24:43,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:24:43,494 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758400087] [2021-08-12 17:24:43,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:24:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:24:43,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:24:43,578 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:24:43,578 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758400087] [2021-08-12 17:24:43,578 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758400087] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:24:43,578 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:24:43,578 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 17:24:43,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267489884] [2021-08-12 17:24:43,579 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 17:24:43,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:24:43,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 17:24:43,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-12 17:24:43,580 INFO L87 Difference]: Start difference. First operand 5202 states and 16938 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:43,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:24:43,944 INFO L93 Difference]: Finished difference Result 6768 states and 21834 transitions. [2021-08-12 17:24:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 17:24:43,944 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-08-12 17:24:43,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:24:43,970 INFO L225 Difference]: With dead ends: 6768 [2021-08-12 17:24:43,970 INFO L226 Difference]: Without dead ends: 3528 [2021-08-12 17:24:43,977 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 96.9ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-12 17:24:43,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2021-08-12 17:24:44,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3444. [2021-08-12 17:24:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3444 states, 3443 states have (on average 3.0987510891664245) internal successors, (10669), 3443 states have internal predecessors, (10669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 3444 states and 10669 transitions. [2021-08-12 17:24:44,122 INFO L78 Accepts]: Start accepts. Automaton has 3444 states and 10669 transitions. Word has length 75 [2021-08-12 17:24:44,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:24:44,122 INFO L482 AbstractCegarLoop]: Abstraction has 3444 states and 10669 transitions. [2021-08-12 17:24:44,122 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:44,123 INFO L276 IsEmpty]: Start isEmpty. Operand 3444 states and 10669 transitions. [2021-08-12 17:24:44,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-12 17:24:44,130 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:24:44,130 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:24:44,130 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-12 17:24:44,130 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:24:44,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:24:44,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1348052516, now seen corresponding path program 1 times [2021-08-12 17:24:44,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:24:44,131 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674190285] [2021-08-12 17:24:44,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:24:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:24:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:24:44,240 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:24:44,241 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674190285] [2021-08-12 17:24:44,241 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674190285] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:24:44,241 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:24:44,241 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 17:24:44,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000220873] [2021-08-12 17:24:44,241 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 17:24:44,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:24:44,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 17:24:44,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-12 17:24:44,242 INFO L87 Difference]: Start difference. First operand 3444 states and 10669 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:44,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:24:44,539 INFO L93 Difference]: Finished difference Result 3768 states and 11614 transitions. [2021-08-12 17:24:44,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-12 17:24:44,539 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-08-12 17:24:44,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:24:44,561 INFO L225 Difference]: With dead ends: 3768 [2021-08-12 17:24:44,561 INFO L226 Difference]: Without dead ends: 1737 [2021-08-12 17:24:44,565 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 126.2ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-12 17:24:44,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2021-08-12 17:24:44,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1689. [2021-08-12 17:24:44,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 1688 states have (on average 2.9597156398104265) internal successors, (4996), 1688 states have internal predecessors, (4996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 4996 transitions. [2021-08-12 17:24:44,641 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 4996 transitions. Word has length 77 [2021-08-12 17:24:44,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:24:44,642 INFO L482 AbstractCegarLoop]: Abstraction has 1689 states and 4996 transitions. [2021-08-12 17:24:44,642 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:44,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 4996 transitions. [2021-08-12 17:24:44,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-12 17:24:44,646 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:24:44,646 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:24:44,646 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-12 17:24:44,646 INFO L430 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:24:44,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:24:44,646 INFO L82 PathProgramCache]: Analyzing trace with hash -146066099, now seen corresponding path program 1 times [2021-08-12 17:24:44,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:24:44,647 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787864343] [2021-08-12 17:24:44,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:24:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:24:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:24:44,880 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:24:44,880 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787864343] [2021-08-12 17:24:44,880 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787864343] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:24:44,880 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:24:44,880 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-12 17:24:44,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200441427] [2021-08-12 17:24:44,881 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-12 17:24:44,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:24:44,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-12 17:24:44,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-08-12 17:24:44,882 INFO L87 Difference]: Start difference. First operand 1689 states and 4996 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:45,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:24:45,201 INFO L93 Difference]: Finished difference Result 2568 states and 7697 transitions. [2021-08-12 17:24:45,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-12 17:24:45,201 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-08-12 17:24:45,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:24:45,223 INFO L225 Difference]: With dead ends: 2568 [2021-08-12 17:24:45,224 INFO L226 Difference]: Without dead ends: 1748 [2021-08-12 17:24:45,225 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 198.0ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-08-12 17:24:45,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2021-08-12 17:24:45,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1433. [2021-08-12 17:24:45,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1432 states have (on average 2.8854748603351954) internal successors, (4132), 1432 states have internal predecessors, (4132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:45,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 4132 transitions. [2021-08-12 17:24:45,291 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 4132 transitions. Word has length 80 [2021-08-12 17:24:45,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:24:45,291 INFO L482 AbstractCegarLoop]: Abstraction has 1433 states and 4132 transitions. [2021-08-12 17:24:45,291 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:45,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 4132 transitions. [2021-08-12 17:24:45,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-12 17:24:45,294 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:24:45,294 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:24:45,295 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-12 17:24:45,295 INFO L430 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:24:45,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:24:45,295 INFO L82 PathProgramCache]: Analyzing trace with hash -490013491, now seen corresponding path program 2 times [2021-08-12 17:24:45,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:24:45,295 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561014312] [2021-08-12 17:24:45,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:24:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:24:45,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:24:45,559 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:24:45,559 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561014312] [2021-08-12 17:24:45,559 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561014312] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:24:45,560 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:24:45,560 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-12 17:24:45,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258439069] [2021-08-12 17:24:45,560 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-08-12 17:24:45,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:24:45,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-12 17:24:45,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-08-12 17:24:45,561 INFO L87 Difference]: Start difference. First operand 1433 states and 4132 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:45,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:24:45,920 INFO L93 Difference]: Finished difference Result 2372 states and 7026 transitions. [2021-08-12 17:24:45,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-12 17:24:45,920 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-08-12 17:24:45,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:24:45,940 INFO L225 Difference]: With dead ends: 2372 [2021-08-12 17:24:45,940 INFO L226 Difference]: Without dead ends: 1408 [2021-08-12 17:24:45,941 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 267.2ms TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2021-08-12 17:24:45,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2021-08-12 17:24:45,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1213. [2021-08-12 17:24:45,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 1212 states have (on average 2.881188118811881) internal successors, (3492), 1212 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:45,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 3492 transitions. [2021-08-12 17:24:46,014 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 3492 transitions. Word has length 80 [2021-08-12 17:24:46,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:24:46,014 INFO L482 AbstractCegarLoop]: Abstraction has 1213 states and 3492 transitions. [2021-08-12 17:24:46,014 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:24:46,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 3492 transitions. [2021-08-12 17:24:46,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-12 17:24:46,017 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:24:46,017 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:24:46,017 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-12 17:24:46,017 INFO L430 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:24:46,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:24:46,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2074299567, now seen corresponding path program 3 times [2021-08-12 17:24:46,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:24:46,018 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040160607] [2021-08-12 17:24:46,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:24:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 17:24:46,055 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 17:24:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 17:24:46,106 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 17:24:46,162 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-12 17:24:46,162 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-12 17:24:46,162 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-12 17:24:46,165 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-12 17:24:46,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.08 05:24:46 BasicIcfg [2021-08-12 17:24:46,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-12 17:24:46,297 INFO L168 Benchmark]: Toolchain (without parser) took 16135.50 ms. Allocated memory was 195.0 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 158.9 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.0 GB. Max. memory is 8.0 GB. [2021-08-12 17:24:46,298 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 195.0 MB. Free memory was 177.2 MB in the beginning and 177.1 MB in the end (delta: 147.8 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-08-12 17:24:46,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 511.25 ms. Allocated memory is still 195.0 MB. Free memory was 158.6 MB in the beginning and 152.7 MB in the end (delta: 6.0 MB). Peak memory consumption was 11.9 MB. Max. memory is 8.0 GB. [2021-08-12 17:24:46,301 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.95 ms. Allocated memory is still 195.0 MB. Free memory was 152.7 MB in the beginning and 150.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-12 17:24:46,302 INFO L168 Benchmark]: Boogie Preprocessor took 34.49 ms. Allocated memory is still 195.0 MB. Free memory was 150.0 MB in the beginning and 147.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-12 17:24:46,302 INFO L168 Benchmark]: RCFGBuilder took 1788.11 ms. Allocated memory was 195.0 MB in the beginning and 234.9 MB in the end (delta: 39.8 MB). Free memory was 147.9 MB in the beginning and 172.0 MB in the end (delta: -24.1 MB). Peak memory consumption was 86.0 MB. Max. memory is 8.0 GB. [2021-08-12 17:24:46,302 INFO L168 Benchmark]: TraceAbstraction took 13744.38 ms. Allocated memory was 234.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 171.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.0 GB. Max. memory is 8.0 GB. [2021-08-12 17:24:46,303 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.14 ms. Allocated memory is still 195.0 MB. Free memory was 177.2 MB in the beginning and 177.1 MB in the end (delta: 147.8 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 511.25 ms. Allocated memory is still 195.0 MB. Free memory was 158.6 MB in the beginning and 152.7 MB in the end (delta: 6.0 MB). Peak memory consumption was 11.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 45.95 ms. Allocated memory is still 195.0 MB. Free memory was 152.7 MB in the beginning and 150.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.49 ms. Allocated memory is still 195.0 MB. Free memory was 150.0 MB in the beginning and 147.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1788.11 ms. Allocated memory was 195.0 MB in the beginning and 234.9 MB in the end (delta: 39.8 MB). Free memory was 147.9 MB in the beginning and 172.0 MB in the end (delta: -24.1 MB). Peak memory consumption was 86.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 13744.38 ms. Allocated memory was 234.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 171.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.0 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] 0 pthread_t t2189; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] FCALL, FORK 0 pthread_create(&t2189, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2190; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] FCALL, FORK 0 pthread_create(&t2190, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 pthread_t t2191; VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L818] FCALL, FORK 0 pthread_create(&t2191, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13514.2ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 220.2ms, AutomataDifference: 6551.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 891.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1790 SDtfs, 2742 SDslu, 6932 SDs, 0 SdLazy, 1016 SolverSat, 204 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1154.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 2033.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=14150occurred in iteration=0, InterpolantAutomatonStates: 146, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2617.5ms AutomataMinimizationTime, 14 MinimizatonAttempts, 2314 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 59.6ms SsaConstructionTime, 700.6ms SatisfiabilityAnalysisTime, 1868.2ms InterpolantComputationTime, 1066 NumberOfCodeBlocks, 1066 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 972 ConstructedInterpolants, 0 QuantifiedInterpolants, 5538 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...