/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.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-a47a088281b0b97d17910950432b7c5b5bc3adeb-a47a088 [2021-07-13 18:52:25,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-13 18:52:25,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-13 18:52:25,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-13 18:52:25,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-13 18:52:25,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-13 18:52:25,729 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-13 18:52:25,734 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-13 18:52:25,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-13 18:52:25,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-13 18:52:25,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-13 18:52:25,743 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-13 18:52:25,743 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-13 18:52:25,745 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-13 18:52:25,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-13 18:52:25,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-13 18:52:25,750 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-13 18:52:25,751 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-13 18:52:25,753 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-13 18:52:25,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-13 18:52:25,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-13 18:52:25,761 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-13 18:52:25,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-13 18:52:25,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-13 18:52:25,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-13 18:52:25,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-13 18:52:25,773 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-13 18:52:25,774 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-13 18:52:25,775 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-13 18:52:25,775 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-13 18:52:25,776 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-13 18:52:25,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-13 18:52:25,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-13 18:52:25,778 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-13 18:52:25,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-13 18:52:25,780 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-13 18:52:25,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-13 18:52:25,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-13 18:52:25,781 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-13 18:52:25,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-13 18:52:25,782 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-13 18:52:25,786 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-07-13 18:52:25,822 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-13 18:52:25,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-13 18:52:25,823 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-13 18:52:25,823 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-13 18:52:25,825 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-13 18:52:25,826 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-13 18:52:25,826 INFO L138 SettingsManager]: * Use SBE=true [2021-07-13 18:52:25,826 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-13 18:52:25,826 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-13 18:52:25,827 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-13 18:52:25,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-13 18:52:25,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-13 18:52:25,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-13 18:52:25,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-13 18:52:25,829 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-13 18:52:25,829 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-13 18:52:25,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-13 18:52:25,829 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-13 18:52:25,829 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-13 18:52:25,829 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-13 18:52:25,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-13 18:52:25,830 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-13 18:52:25,830 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-13 18:52:25,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-13 18:52:25,830 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-13 18:52:25,830 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-13 18:52:25,840 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-13 18:52:25,840 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-13 18:52:25,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-13 18:52:25,840 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-13 18:52:25,841 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-13 18:52:25,841 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-07-13 18:52:26,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-13 18:52:26,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-13 18:52:26,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-13 18:52:26,205 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-13 18:52:26,205 INFO L275 PluginConnector]: CDTParser initialized [2021-07-13 18:52:26,206 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_rmo.opt.i [2021-07-13 18:52:26,267 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d3886da3/8f23efadbf1140448e97c7adbca8c358/FLAGa6c4899f2 [2021-07-13 18:52:26,966 INFO L306 CDTParser]: Found 1 translation units. [2021-07-13 18:52:26,967 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_rmo.opt.i [2021-07-13 18:52:26,984 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d3886da3/8f23efadbf1140448e97c7adbca8c358/FLAGa6c4899f2 [2021-07-13 18:52:27,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d3886da3/8f23efadbf1140448e97c7adbca8c358 [2021-07-13 18:52:27,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-13 18:52:27,133 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-13 18:52:27,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-13 18:52:27,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-13 18:52:27,140 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-13 18:52:27,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:52:27" (1/1) ... [2021-07-13 18:52:27,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@282bd3a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:52:27, skipping insertion in model container [2021-07-13 18:52:27,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:52:27" (1/1) ... [2021-07-13 18:52:27,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-13 18:52:27,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-13 18:52:27,375 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.opt.i[949,962] [2021-07-13 18:52:27,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-13 18:52:27,580 INFO L203 MainTranslator]: Completed pre-run [2021-07-13 18:52:27,619 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.opt.i[949,962] [2021-07-13 18:52:27,680 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-13 18:52:27,724 INFO L208 MainTranslator]: Completed translation [2021-07-13 18:52:27,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:52:27 WrapperNode [2021-07-13 18:52:27,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-13 18:52:27,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-13 18:52:27,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-13 18:52:27,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-13 18:52:27,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:52:27" (1/1) ... [2021-07-13 18:52:27,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:52:27" (1/1) ... [2021-07-13 18:52:27,781 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-13 18:52:27,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-13 18:52:27,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-13 18:52:27,782 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-13 18:52:27,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:52:27" (1/1) ... [2021-07-13 18:52:27,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:52:27" (1/1) ... [2021-07-13 18:52:27,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:52:27" (1/1) ... [2021-07-13 18:52:27,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:52:27" (1/1) ... [2021-07-13 18:52:27,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:52:27" (1/1) ... [2021-07-13 18:52:27,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:52:27" (1/1) ... [2021-07-13 18:52:27,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:52:27" (1/1) ... [2021-07-13 18:52:27,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-13 18:52:27,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-13 18:52:27,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-13 18:52:27,824 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-13 18:52:27,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:52:27" (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-07-13 18:52:27,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-13 18:52:27,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-13 18:52:27,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-13 18:52:27,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-13 18:52:27,894 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-13 18:52:27,894 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-13 18:52:27,895 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-13 18:52:27,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-13 18:52:27,895 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-07-13 18:52:27,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-07-13 18:52:27,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-13 18:52:27,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-13 18:52:27,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-13 18:52:27,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-13 18:52:27,897 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-13 18:52:29,629 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-13 18:52:29,630 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-13 18:52:29,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:52:29 BoogieIcfgContainer [2021-07-13 18:52:29,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-13 18:52:29,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-13 18:52:29,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-13 18:52:29,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-13 18:52:29,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:52:27" (1/3) ... [2021-07-13 18:52:29,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b458d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:52:29, skipping insertion in model container [2021-07-13 18:52:29,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:52:27" (2/3) ... [2021-07-13 18:52:29,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b458d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:52:29, skipping insertion in model container [2021-07-13 18:52:29,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:52:29" (3/3) ... [2021-07-13 18:52:29,639 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_rmo.opt.i [2021-07-13 18:52:29,646 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-13 18:52:29,646 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-13 18:52:29,646 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-13 18:52:29,647 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-13 18:52:29,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,676 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,676 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,677 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,677 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,677 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,677 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,677 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,677 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,678 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,678 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,683 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,686 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,686 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,687 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,687 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,690 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,690 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,690 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,690 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,690 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,690 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,690 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,690 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,695 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,695 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,699 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,702 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,708 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,710 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,710 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:52:29,711 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-13 18:52:29,731 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-07-13 18:52:29,752 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-13 18:52:29,753 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-13 18:52:29,753 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-13 18:52:29,753 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-13 18:52:29,753 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-13 18:52:29,753 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-13 18:52:29,753 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-13 18:52:29,753 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-13 18:52:29,769 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 104 transitions, 223 flow [2021-07-13 18:52:30,057 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 8606 states, 8604 states have (on average 3.5527661552766157) internal successors, (30568), 8605 states have internal predecessors, (30568), 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-07-13 18:52:30,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 8606 states, 8604 states have (on average 3.5527661552766157) internal successors, (30568), 8605 states have internal predecessors, (30568), 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-07-13 18:52:30,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-07-13 18:52:30,148 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:52:30,149 INFO L508 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-07-13 18:52:30,149 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:52:30,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:52:30,154 INFO L82 PathProgramCache]: Analyzing trace with hash -247046329, now seen corresponding path program 1 times [2021-07-13 18:52:30,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:52:30,161 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357574586] [2021-07-13 18:52:30,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:52:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:52:30,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:52:30,584 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:52:30,585 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357574586] [2021-07-13 18:52:30,585 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357574586] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:52:30,586 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:52:30,587 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:52:30,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290299687] [2021-07-13 18:52:30,590 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:52:30,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:52:30,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:52:30,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:52:30,632 INFO L87 Difference]: Start difference. First operand has 8606 states, 8604 states have (on average 3.5527661552766157) internal successors, (30568), 8605 states have internal predecessors, (30568), 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 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-07-13 18:52:30,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:52:30,973 INFO L93 Difference]: Finished difference Result 9866 states and 34154 transitions. [2021-07-13 18:52:30,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:52:30,975 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-07-13 18:52:30,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:52:31,054 INFO L225 Difference]: With dead ends: 9866 [2021-07-13 18:52:31,054 INFO L226 Difference]: Without dead ends: 7346 [2021-07-13 18:52:31,055 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 97.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:52:31,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7346 states. [2021-07-13 18:52:31,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7346 to 7346. [2021-07-13 18:52:31,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7346 states, 7344 states have (on average 3.4595588235294117) internal successors, (25407), 7345 states have internal predecessors, (25407), 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-07-13 18:52:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7346 states to 7346 states and 25407 transitions. [2021-07-13 18:52:31,566 INFO L78 Accepts]: Start accepts. Automaton has 7346 states and 25407 transitions. Word has length 66 [2021-07-13 18:52:31,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:52:31,567 INFO L482 AbstractCegarLoop]: Abstraction has 7346 states and 25407 transitions. [2021-07-13 18:52:31,567 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-07-13 18:52:31,567 INFO L276 IsEmpty]: Start isEmpty. Operand 7346 states and 25407 transitions. [2021-07-13 18:52:31,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-07-13 18:52:31,581 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:52:31,581 INFO L508 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-07-13 18:52:31,582 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-13 18:52:31,582 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:52:31,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:52:31,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1410751468, now seen corresponding path program 1 times [2021-07-13 18:52:31,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:52:31,583 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852925682] [2021-07-13 18:52:31,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:52:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:52:31,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:52:31,875 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:52:31,876 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852925682] [2021-07-13 18:52:31,876 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852925682] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:52:31,876 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:52:31,876 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-13 18:52:31,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767580269] [2021-07-13 18:52:31,878 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-13 18:52:31,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:52:31,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-13 18:52:31,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-13 18:52:31,880 INFO L87 Difference]: Start difference. First operand 7346 states and 25407 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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-07-13 18:52:32,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:52:32,140 INFO L93 Difference]: Finished difference Result 11540 states and 39906 transitions. [2021-07-13 18:52:32,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-13 18:52:32,141 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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-07-13 18:52:32,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:52:32,263 INFO L225 Difference]: With dead ends: 11540 [2021-07-13 18:52:32,263 INFO L226 Difference]: Without dead ends: 6626 [2021-07-13 18:52:32,264 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 115.7ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-07-13 18:52:32,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6626 states. [2021-07-13 18:52:32,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6626 to 6626. [2021-07-13 18:52:32,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6626 states, 6624 states have (on average 3.4153079710144927) internal successors, (22623), 6625 states have internal predecessors, (22623), 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-07-13 18:52:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6626 states to 6626 states and 22623 transitions. [2021-07-13 18:52:32,531 INFO L78 Accepts]: Start accepts. Automaton has 6626 states and 22623 transitions. Word has length 68 [2021-07-13 18:52:32,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:52:32,533 INFO L482 AbstractCegarLoop]: Abstraction has 6626 states and 22623 transitions. [2021-07-13 18:52:32,534 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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-07-13 18:52:32,534 INFO L276 IsEmpty]: Start isEmpty. Operand 6626 states and 22623 transitions. [2021-07-13 18:52:32,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-07-13 18:52:32,550 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:52:32,551 INFO L508 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-07-13 18:52:32,551 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-13 18:52:32,551 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:52:32,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:52:32,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1118791733, now seen corresponding path program 1 times [2021-07-13 18:52:32,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:52:32,559 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818198219] [2021-07-13 18:52:32,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:52:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:52:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:52:32,858 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:52:32,858 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818198219] [2021-07-13 18:52:32,858 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818198219] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:52:32,858 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:52:32,859 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-13 18:52:32,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255538154] [2021-07-13 18:52:32,859 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-13 18:52:32,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:52:32,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-13 18:52:32,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:52:32,860 INFO L87 Difference]: Start difference. First operand 6626 states and 22623 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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-07-13 18:52:33,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:52:33,271 INFO L93 Difference]: Finished difference Result 8125 states and 27410 transitions. [2021-07-13 18:52:33,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-07-13 18:52:33,272 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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-07-13 18:52:33,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:52:33,312 INFO L225 Difference]: With dead ends: 8125 [2021-07-13 18:52:33,312 INFO L226 Difference]: Without dead ends: 6997 [2021-07-13 18:52:33,313 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 205.1ms TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2021-07-13 18:52:33,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6997 states. [2021-07-13 18:52:33,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6997 to 6566. [2021-07-13 18:52:33,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6566 states, 6564 states have (on average 3.4072212065813527) internal successors, (22365), 6565 states have internal predecessors, (22365), 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-07-13 18:52:33,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6566 states to 6566 states and 22365 transitions. [2021-07-13 18:52:33,589 INFO L78 Accepts]: Start accepts. Automaton has 6566 states and 22365 transitions. Word has length 70 [2021-07-13 18:52:33,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:52:33,591 INFO L482 AbstractCegarLoop]: Abstraction has 6566 states and 22365 transitions. [2021-07-13 18:52:33,591 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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-07-13 18:52:33,591 INFO L276 IsEmpty]: Start isEmpty. Operand 6566 states and 22365 transitions. [2021-07-13 18:52:33,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-13 18:52:33,606 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:52:33,606 INFO L508 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-07-13 18:52:33,607 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-13 18:52:33,607 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:52:33,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:52:33,608 INFO L82 PathProgramCache]: Analyzing trace with hash -661853219, now seen corresponding path program 1 times [2021-07-13 18:52:33,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:52:33,608 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429586775] [2021-07-13 18:52:33,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:52:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:52:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:52:33,780 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:52:33,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429586775] [2021-07-13 18:52:33,782 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429586775] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:52:33,782 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:52:33,783 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-13 18:52:33,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221686079] [2021-07-13 18:52:33,784 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-13 18:52:33,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:52:33,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-13 18:52:33,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-13 18:52:33,784 INFO L87 Difference]: Start difference. First operand 6566 states and 22365 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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-07-13 18:52:34,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:52:34,078 INFO L93 Difference]: Finished difference Result 13821 states and 46529 transitions. [2021-07-13 18:52:34,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-13 18:52:34,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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-07-13 18:52:34,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:52:34,101 INFO L225 Difference]: With dead ends: 13821 [2021-07-13 18:52:34,101 INFO L226 Difference]: Without dead ends: 6566 [2021-07-13 18:52:34,102 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 192.6ms TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-07-13 18:52:34,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6566 states. [2021-07-13 18:52:34,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6566 to 5666. [2021-07-13 18:52:34,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5666 states, 5664 states have (on average 3.2962570621468927) internal successors, (18670), 5665 states have internal predecessors, (18670), 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-07-13 18:52:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5666 states to 5666 states and 18670 transitions. [2021-07-13 18:52:34,270 INFO L78 Accepts]: Start accepts. Automaton has 5666 states and 18670 transitions. Word has length 71 [2021-07-13 18:52:34,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:52:34,270 INFO L482 AbstractCegarLoop]: Abstraction has 5666 states and 18670 transitions. [2021-07-13 18:52:34,270 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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-07-13 18:52:34,270 INFO L276 IsEmpty]: Start isEmpty. Operand 5666 states and 18670 transitions. [2021-07-13 18:52:34,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-13 18:52:34,281 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:52:34,282 INFO L508 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-07-13 18:52:34,282 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-13 18:52:34,282 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:52:34,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:52:34,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1168582365, now seen corresponding path program 1 times [2021-07-13 18:52:34,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:52:34,283 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129283155] [2021-07-13 18:52:34,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:52:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:52:34,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:52:34,504 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:52:34,504 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129283155] [2021-07-13 18:52:34,504 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129283155] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:52:34,504 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:52:34,504 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-13 18:52:34,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927372673] [2021-07-13 18:52:34,505 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-13 18:52:34,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:52:34,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-13 18:52:34,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-07-13 18:52:34,506 INFO L87 Difference]: Start difference. First operand 5666 states and 18670 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 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-07-13 18:52:34,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:52:34,838 INFO L93 Difference]: Finished difference Result 5940 states and 19457 transitions. [2021-07-13 18:52:34,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-13 18:52:34,839 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 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-07-13 18:52:34,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:52:34,862 INFO L225 Difference]: With dead ends: 5940 [2021-07-13 18:52:34,862 INFO L226 Difference]: Without dead ends: 5108 [2021-07-13 18:52:34,862 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 186.1ms TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2021-07-13 18:52:34,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5108 states. [2021-07-13 18:52:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5108 to 5044. [2021-07-13 18:52:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5044 states, 5043 states have (on average 3.2748364069006546) internal successors, (16515), 5043 states have internal predecessors, (16515), 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-07-13 18:52:35,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5044 states to 5044 states and 16515 transitions. [2021-07-13 18:52:35,104 INFO L78 Accepts]: Start accepts. Automaton has 5044 states and 16515 transitions. Word has length 71 [2021-07-13 18:52:35,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:52:35,105 INFO L482 AbstractCegarLoop]: Abstraction has 5044 states and 16515 transitions. [2021-07-13 18:52:35,105 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 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-07-13 18:52:35,106 INFO L276 IsEmpty]: Start isEmpty. Operand 5044 states and 16515 transitions. [2021-07-13 18:52:35,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-13 18:52:35,116 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:52:35,116 INFO L508 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-07-13 18:52:35,116 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-13 18:52:35,116 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:52:35,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:52:35,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1935675461, now seen corresponding path program 2 times [2021-07-13 18:52:35,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:52:35,117 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923727324] [2021-07-13 18:52:35,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:52:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:52:35,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:52:35,307 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:52:35,308 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923727324] [2021-07-13 18:52:35,308 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923727324] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:52:35,308 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:52:35,308 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-13 18:52:35,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153862288] [2021-07-13 18:52:35,308 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-13 18:52:35,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:52:35,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-13 18:52:35,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-07-13 18:52:35,309 INFO L87 Difference]: Start difference. First operand 5044 states and 16515 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-07-13 18:52:35,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:52:35,574 INFO L93 Difference]: Finished difference Result 5608 states and 18305 transitions. [2021-07-13 18:52:35,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-13 18:52:35,575 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-07-13 18:52:35,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:52:35,593 INFO L225 Difference]: With dead ends: 5608 [2021-07-13 18:52:35,593 INFO L226 Difference]: Without dead ends: 4808 [2021-07-13 18:52:35,594 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 138.5ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-07-13 18:52:35,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4808 states. [2021-07-13 18:52:35,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4808 to 4734. [2021-07-13 18:52:35,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4734 states, 4733 states have (on average 3.25522924149588) internal successors, (15407), 4733 states have internal predecessors, (15407), 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-07-13 18:52:35,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4734 states to 4734 states and 15407 transitions. [2021-07-13 18:52:35,749 INFO L78 Accepts]: Start accepts. Automaton has 4734 states and 15407 transitions. Word has length 71 [2021-07-13 18:52:35,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:52:35,749 INFO L482 AbstractCegarLoop]: Abstraction has 4734 states and 15407 transitions. [2021-07-13 18:52:35,750 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-07-13 18:52:35,750 INFO L276 IsEmpty]: Start isEmpty. Operand 4734 states and 15407 transitions. [2021-07-13 18:52:35,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-07-13 18:52:35,762 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:52:35,762 INFO L508 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-07-13 18:52:35,762 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-13 18:52:35,762 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:52:35,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:52:35,763 INFO L82 PathProgramCache]: Analyzing trace with hash -102679091, now seen corresponding path program 1 times [2021-07-13 18:52:35,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:52:35,763 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135624989] [2021-07-13 18:52:35,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:52:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:52:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:52:35,907 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:52:35,907 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135624989] [2021-07-13 18:52:35,908 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135624989] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:52:35,908 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:52:35,908 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-13 18:52:35,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223772240] [2021-07-13 18:52:35,909 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-13 18:52:35,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:52:35,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-13 18:52:35,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-07-13 18:52:35,909 INFO L87 Difference]: Start difference. First operand 4734 states and 15407 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 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-07-13 18:52:36,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:52:36,103 INFO L93 Difference]: Finished difference Result 5442 states and 17677 transitions. [2021-07-13 18:52:36,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-13 18:52:36,104 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 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-07-13 18:52:36,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:52:36,120 INFO L225 Difference]: With dead ends: 5442 [2021-07-13 18:52:36,120 INFO L226 Difference]: Without dead ends: 4722 [2021-07-13 18:52:36,121 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 121.2ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-07-13 18:52:36,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4722 states. [2021-07-13 18:52:36,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4722 to 4722. [2021-07-13 18:52:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4722 states, 4721 states have (on average 3.25333615759373) internal successors, (15359), 4721 states have internal predecessors, (15359), 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-07-13 18:52:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4722 states to 4722 states and 15359 transitions. [2021-07-13 18:52:36,320 INFO L78 Accepts]: Start accepts. Automaton has 4722 states and 15359 transitions. Word has length 72 [2021-07-13 18:52:36,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:52:36,320 INFO L482 AbstractCegarLoop]: Abstraction has 4722 states and 15359 transitions. [2021-07-13 18:52:36,321 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 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-07-13 18:52:36,321 INFO L276 IsEmpty]: Start isEmpty. Operand 4722 states and 15359 transitions. [2021-07-13 18:52:36,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-07-13 18:52:36,331 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:52:36,331 INFO L508 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-07-13 18:52:36,331 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-13 18:52:36,332 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:52:36,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:52:36,332 INFO L82 PathProgramCache]: Analyzing trace with hash -485189295, now seen corresponding path program 1 times [2021-07-13 18:52:36,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:52:36,332 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383222516] [2021-07-13 18:52:36,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:52:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:52:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:52:36,516 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:52:36,516 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383222516] [2021-07-13 18:52:36,517 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383222516] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:52:36,517 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:52:36,517 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-13 18:52:36,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227455778] [2021-07-13 18:52:36,517 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-13 18:52:36,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:52:36,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-13 18:52:36,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-07-13 18:52:36,518 INFO L87 Difference]: Start difference. First operand 4722 states and 15359 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-07-13 18:52:36,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:52:36,803 INFO L93 Difference]: Finished difference Result 5250 states and 17011 transitions. [2021-07-13 18:52:36,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-13 18:52:36,804 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-07-13 18:52:36,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:52:36,817 INFO L225 Difference]: With dead ends: 5250 [2021-07-13 18:52:36,817 INFO L226 Difference]: Without dead ends: 4674 [2021-07-13 18:52:36,817 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 209.4ms TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2021-07-13 18:52:36,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4674 states. [2021-07-13 18:52:36,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4674 to 4674. [2021-07-13 18:52:36,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4674 states, 4673 states have (on average 3.2482345388401455) internal successors, (15179), 4673 states have internal predecessors, (15179), 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-07-13 18:52:36,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4674 states to 4674 states and 15179 transitions. [2021-07-13 18:52:36,936 INFO L78 Accepts]: Start accepts. Automaton has 4674 states and 15179 transitions. Word has length 73 [2021-07-13 18:52:36,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:52:36,937 INFO L482 AbstractCegarLoop]: Abstraction has 4674 states and 15179 transitions. [2021-07-13 18:52:36,937 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-07-13 18:52:36,937 INFO L276 IsEmpty]: Start isEmpty. Operand 4674 states and 15179 transitions. [2021-07-13 18:52:36,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-07-13 18:52:36,946 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:52:36,947 INFO L508 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-07-13 18:52:36,947 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-13 18:52:36,947 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:52:36,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:52:36,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1691664101, now seen corresponding path program 1 times [2021-07-13 18:52:36,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:52:36,948 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721499704] [2021-07-13 18:52:36,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:52:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:52:37,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:52:37,149 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:52:37,149 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721499704] [2021-07-13 18:52:37,149 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721499704] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:52:37,149 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:52:37,150 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-13 18:52:37,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695917621] [2021-07-13 18:52:37,150 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-13 18:52:37,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:52:37,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-13 18:52:37,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-07-13 18:52:37,151 INFO L87 Difference]: Start difference. First operand 4674 states and 15179 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 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-07-13 18:52:37,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:52:37,766 INFO L93 Difference]: Finished difference Result 6430 states and 20730 transitions. [2021-07-13 18:52:37,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-07-13 18:52:37,767 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 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-07-13 18:52:37,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:52:37,781 INFO L225 Difference]: With dead ends: 6430 [2021-07-13 18:52:37,782 INFO L226 Difference]: Without dead ends: 5798 [2021-07-13 18:52:37,782 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 469.6ms TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2021-07-13 18:52:37,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5798 states. [2021-07-13 18:52:37,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5798 to 4714. [2021-07-13 18:52:37,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4714 states, 4713 states have (on average 3.2423085083810737) internal successors, (15281), 4713 states have internal predecessors, (15281), 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-07-13 18:52:37,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4714 states to 4714 states and 15281 transitions. [2021-07-13 18:52:37,925 INFO L78 Accepts]: Start accepts. Automaton has 4714 states and 15281 transitions. Word has length 73 [2021-07-13 18:52:37,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:52:37,925 INFO L482 AbstractCegarLoop]: Abstraction has 4714 states and 15281 transitions. [2021-07-13 18:52:37,925 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 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-07-13 18:52:37,925 INFO L276 IsEmpty]: Start isEmpty. Operand 4714 states and 15281 transitions. [2021-07-13 18:52:37,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-07-13 18:52:37,935 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:52:37,935 INFO L508 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-07-13 18:52:37,935 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-13 18:52:37,935 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:52:37,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:52:37,936 INFO L82 PathProgramCache]: Analyzing trace with hash -500954631, now seen corresponding path program 2 times [2021-07-13 18:52:37,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:52:37,936 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862458516] [2021-07-13 18:52:37,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:52:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:52:38,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:52:38,105 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:52:38,105 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862458516] [2021-07-13 18:52:38,105 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862458516] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:52:38,105 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:52:38,105 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-13 18:52:38,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430728288] [2021-07-13 18:52:38,106 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-13 18:52:38,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:52:38,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-13 18:52:38,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-07-13 18:52:38,106 INFO L87 Difference]: Start difference. First operand 4714 states and 15281 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 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-07-13 18:52:38,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:52:38,418 INFO L93 Difference]: Finished difference Result 5812 states and 18882 transitions. [2021-07-13 18:52:38,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-13 18:52:38,418 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 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-07-13 18:52:38,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:52:38,430 INFO L225 Difference]: With dead ends: 5812 [2021-07-13 18:52:38,430 INFO L226 Difference]: Without dead ends: 5100 [2021-07-13 18:52:38,430 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 155.6ms TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-07-13 18:52:38,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5100 states. [2021-07-13 18:52:38,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5100 to 4945. [2021-07-13 18:52:38,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4945 states, 4944 states have (on average 3.2518203883495147) internal successors, (16077), 4944 states have internal predecessors, (16077), 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-07-13 18:52:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4945 states to 4945 states and 16077 transitions. [2021-07-13 18:52:38,563 INFO L78 Accepts]: Start accepts. Automaton has 4945 states and 16077 transitions. Word has length 73 [2021-07-13 18:52:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:52:38,563 INFO L482 AbstractCegarLoop]: Abstraction has 4945 states and 16077 transitions. [2021-07-13 18:52:38,563 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 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-07-13 18:52:38,564 INFO L276 IsEmpty]: Start isEmpty. Operand 4945 states and 16077 transitions. [2021-07-13 18:52:38,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-07-13 18:52:38,573 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:52:38,573 INFO L508 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-07-13 18:52:38,574 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-13 18:52:38,574 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:52:38,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:52:38,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1174952317, now seen corresponding path program 3 times [2021-07-13 18:52:38,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:52:38,574 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095730033] [2021-07-13 18:52:38,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:52:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:52:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:52:38,759 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:52:38,759 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095730033] [2021-07-13 18:52:38,759 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095730033] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:52:38,759 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:52:38,759 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-13 18:52:38,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981451374] [2021-07-13 18:52:38,760 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-13 18:52:38,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:52:38,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-13 18:52:38,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-07-13 18:52:38,762 INFO L87 Difference]: Start difference. First operand 4945 states and 16077 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 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-07-13 18:52:39,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:52:39,039 INFO L93 Difference]: Finished difference Result 5683 states and 18450 transitions. [2021-07-13 18:52:39,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-13 18:52:39,040 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 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-07-13 18:52:39,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:52:39,051 INFO L225 Difference]: With dead ends: 5683 [2021-07-13 18:52:39,052 INFO L226 Difference]: Without dead ends: 5051 [2021-07-13 18:52:39,052 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 187.4ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-07-13 18:52:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5051 states. [2021-07-13 18:52:39,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5051 to 5001. [2021-07-13 18:52:39,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5001 states, 5000 states have (on average 3.2586) internal successors, (16293), 5000 states have internal predecessors, (16293), 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-07-13 18:52:39,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5001 states to 5001 states and 16293 transitions. [2021-07-13 18:52:39,189 INFO L78 Accepts]: Start accepts. Automaton has 5001 states and 16293 transitions. Word has length 73 [2021-07-13 18:52:39,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:52:39,189 INFO L482 AbstractCegarLoop]: Abstraction has 5001 states and 16293 transitions. [2021-07-13 18:52:39,189 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 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-07-13 18:52:39,190 INFO L276 IsEmpty]: Start isEmpty. Operand 5001 states and 16293 transitions. [2021-07-13 18:52:39,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-07-13 18:52:39,201 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:52:39,201 INFO L508 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-07-13 18:52:39,201 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-13 18:52:39,201 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:52:39,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:52:39,202 INFO L82 PathProgramCache]: Analyzing trace with hash -2011824945, now seen corresponding path program 4 times [2021-07-13 18:52:39,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:52:39,202 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45641417] [2021-07-13 18:52:39,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:52:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:52:39,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:52:39,370 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:52:39,370 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45641417] [2021-07-13 18:52:39,370 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45641417] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:52:39,370 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:52:39,370 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-13 18:52:39,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430610177] [2021-07-13 18:52:39,371 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-13 18:52:39,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:52:39,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-13 18:52:39,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-07-13 18:52:39,372 INFO L87 Difference]: Start difference. First operand 5001 states and 16293 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 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-07-13 18:52:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:52:39,741 INFO L93 Difference]: Finished difference Result 5828 states and 18903 transitions. [2021-07-13 18:52:39,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-13 18:52:39,741 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 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-07-13 18:52:39,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:52:39,751 INFO L225 Difference]: With dead ends: 5828 [2021-07-13 18:52:39,752 INFO L226 Difference]: Without dead ends: 5196 [2021-07-13 18:52:39,752 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 241.1ms TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-07-13 18:52:39,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5196 states. [2021-07-13 18:52:39,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5196 to 4986. [2021-07-13 18:52:39,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4986 states, 4985 states have (on average 3.257372116349047) internal successors, (16238), 4985 states have internal predecessors, (16238), 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-07-13 18:52:39,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4986 states to 4986 states and 16238 transitions. [2021-07-13 18:52:39,865 INFO L78 Accepts]: Start accepts. Automaton has 4986 states and 16238 transitions. Word has length 73 [2021-07-13 18:52:39,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:52:39,865 INFO L482 AbstractCegarLoop]: Abstraction has 4986 states and 16238 transitions. [2021-07-13 18:52:39,866 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 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-07-13 18:52:39,866 INFO L276 IsEmpty]: Start isEmpty. Operand 4986 states and 16238 transitions. [2021-07-13 18:52:39,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-07-13 18:52:39,877 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:52:39,877 INFO L508 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-07-13 18:52:39,877 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-13 18:52:39,877 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:52:39,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:52:39,878 INFO L82 PathProgramCache]: Analyzing trace with hash 133115822, now seen corresponding path program 1 times [2021-07-13 18:52:39,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:52:39,878 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791882201] [2021-07-13 18:52:39,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:52:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:52:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:52:39,971 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:52:39,971 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791882201] [2021-07-13 18:52:39,971 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791882201] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:52:39,971 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:52:39,971 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:52:39,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773969155] [2021-07-13 18:52:39,972 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:52:39,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:52:39,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:52:39,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:52:39,973 INFO L87 Difference]: Start difference. First operand 4986 states and 16238 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-07-13 18:52:40,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:52:40,079 INFO L93 Difference]: Finished difference Result 6010 states and 19264 transitions. [2021-07-13 18:52:40,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:52:40,080 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-07-13 18:52:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:52:40,090 INFO L225 Difference]: With dead ends: 6010 [2021-07-13 18:52:40,090 INFO L226 Difference]: Without dead ends: 4458 [2021-07-13 18:52:40,090 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 69.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:52:40,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4458 states. [2021-07-13 18:52:40,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4458 to 4458. [2021-07-13 18:52:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4458 states, 4457 states have (on average 3.1976665918779448) internal successors, (14252), 4457 states have internal predecessors, (14252), 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-07-13 18:52:40,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4458 states to 4458 states and 14252 transitions. [2021-07-13 18:52:40,202 INFO L78 Accepts]: Start accepts. Automaton has 4458 states and 14252 transitions. Word has length 74 [2021-07-13 18:52:40,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:52:40,202 INFO L482 AbstractCegarLoop]: Abstraction has 4458 states and 14252 transitions. [2021-07-13 18:52:40,202 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-07-13 18:52:40,202 INFO L276 IsEmpty]: Start isEmpty. Operand 4458 states and 14252 transitions. [2021-07-13 18:52:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-07-13 18:52:40,213 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:52:40,213 INFO L508 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-07-13 18:52:40,213 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-07-13 18:52:40,213 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:52:40,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:52:40,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1397419933, now seen corresponding path program 1 times [2021-07-13 18:52:40,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:52:40,214 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506936263] [2021-07-13 18:52:40,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:52:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:52:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:52:40,292 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:52:40,292 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506936263] [2021-07-13 18:52:40,292 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506936263] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:52:40,292 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:52:40,292 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-13 18:52:40,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081460305] [2021-07-13 18:52:40,293 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-13 18:52:40,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:52:40,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-13 18:52:40,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-13 18:52:40,293 INFO L87 Difference]: Start difference. First operand 4458 states and 14252 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-07-13 18:52:40,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:52:40,425 INFO L93 Difference]: Finished difference Result 4356 states and 13530 transitions. [2021-07-13 18:52:40,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-13 18:52:40,425 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-07-13 18:52:40,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:52:40,430 INFO L225 Difference]: With dead ends: 4356 [2021-07-13 18:52:40,431 INFO L226 Difference]: Without dead ends: 3108 [2021-07-13 18:52:40,431 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 93.8ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-13 18:52:40,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2021-07-13 18:52:40,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 3048. [2021-07-13 18:52:40,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3048 states, 3047 states have (on average 3.048572366261897) internal successors, (9289), 3047 states have internal predecessors, (9289), 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-07-13 18:52:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 9289 transitions. [2021-07-13 18:52:40,488 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 9289 transitions. Word has length 75 [2021-07-13 18:52:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:52:40,488 INFO L482 AbstractCegarLoop]: Abstraction has 3048 states and 9289 transitions. [2021-07-13 18:52:40,488 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-07-13 18:52:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 9289 transitions. [2021-07-13 18:52:40,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-07-13 18:52:40,494 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:52:40,494 INFO L508 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-07-13 18:52:40,494 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-07-13 18:52:40,495 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:52:40,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:52:40,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1038959876, now seen corresponding path program 1 times [2021-07-13 18:52:40,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:52:40,495 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128742205] [2021-07-13 18:52:40,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:52:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:52:40,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:52:40,583 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:52:40,583 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128742205] [2021-07-13 18:52:40,583 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128742205] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:52:40,583 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:52:40,583 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-13 18:52:40,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734649028] [2021-07-13 18:52:40,583 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-13 18:52:40,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:52:40,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-13 18:52:40,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-13 18:52:40,584 INFO L87 Difference]: Start difference. First operand 3048 states and 9289 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-07-13 18:52:40,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:52:40,709 INFO L93 Difference]: Finished difference Result 2490 states and 7384 transitions. [2021-07-13 18:52:40,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-13 18:52:40,709 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-07-13 18:52:40,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:52:40,713 INFO L225 Difference]: With dead ends: 2490 [2021-07-13 18:52:40,713 INFO L226 Difference]: Without dead ends: 1449 [2021-07-13 18:52:40,713 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 95.7ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-07-13 18:52:40,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2021-07-13 18:52:40,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1401. [2021-07-13 18:52:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1400 states have (on average 2.8785714285714286) internal successors, (4030), 1400 states have internal predecessors, (4030), 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-07-13 18:52:40,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 4030 transitions. [2021-07-13 18:52:40,735 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 4030 transitions. Word has length 77 [2021-07-13 18:52:40,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:52:40,735 INFO L482 AbstractCegarLoop]: Abstraction has 1401 states and 4030 transitions. [2021-07-13 18:52:40,735 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-07-13 18:52:40,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 4030 transitions. [2021-07-13 18:52:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-07-13 18:52:40,738 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:52:40,738 INFO L508 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-07-13 18:52:40,739 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-07-13 18:52:40,739 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:52:40,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:52:40,739 INFO L82 PathProgramCache]: Analyzing trace with hash -377110483, now seen corresponding path program 1 times [2021-07-13 18:52:40,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:52:40,739 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702513455] [2021-07-13 18:52:40,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:52:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:52:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:52:40,917 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:52:40,917 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702513455] [2021-07-13 18:52:40,917 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702513455] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:52:40,917 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:52:40,917 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-13 18:52:40,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315151080] [2021-07-13 18:52:40,917 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-13 18:52:40,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:52:40,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-13 18:52:40,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:52:40,918 INFO L87 Difference]: Start difference. First operand 1401 states and 4030 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 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-07-13 18:52:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:52:41,057 INFO L93 Difference]: Finished difference Result 2031 states and 5938 transitions. [2021-07-13 18:52:41,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:52:41,057 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 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-07-13 18:52:41,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:52:41,060 INFO L225 Difference]: With dead ends: 2031 [2021-07-13 18:52:41,060 INFO L226 Difference]: Without dead ends: 1265 [2021-07-13 18:52:41,060 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 141.1ms TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-07-13 18:52:41,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2021-07-13 18:52:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1145. [2021-07-13 18:52:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 1144 states have (on average 2.7674825174825175) internal successors, (3166), 1144 states have internal predecessors, (3166), 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-07-13 18:52:41,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 3166 transitions. [2021-07-13 18:52:41,080 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 3166 transitions. Word has length 80 [2021-07-13 18:52:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:52:41,080 INFO L482 AbstractCegarLoop]: Abstraction has 1145 states and 3166 transitions. [2021-07-13 18:52:41,080 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 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-07-13 18:52:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 3166 transitions. [2021-07-13 18:52:41,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-07-13 18:52:41,083 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:52:41,083 INFO L508 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-07-13 18:52:41,083 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-07-13 18:52:41,083 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:52:41,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:52:41,083 INFO L82 PathProgramCache]: Analyzing trace with hash 136211181, now seen corresponding path program 2 times [2021-07-13 18:52:41,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:52:41,083 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122719655] [2021-07-13 18:52:41,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:52:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:52:41,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:52:41,314 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:52:41,315 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122719655] [2021-07-13 18:52:41,315 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122719655] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:52:41,315 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:52:41,315 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-13 18:52:41,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587697159] [2021-07-13 18:52:41,315 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-13 18:52:41,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:52:41,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-13 18:52:41,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-07-13 18:52:41,316 INFO L87 Difference]: Start difference. First operand 1145 states and 3166 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 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-07-13 18:52:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:52:41,479 INFO L93 Difference]: Finished difference Result 1715 states and 4881 transitions. [2021-07-13 18:52:41,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-13 18:52:41,479 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 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-07-13 18:52:41,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:52:41,481 INFO L225 Difference]: With dead ends: 1715 [2021-07-13 18:52:41,481 INFO L226 Difference]: Without dead ends: 949 [2021-07-13 18:52:41,482 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 169.2ms TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2021-07-13 18:52:41,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2021-07-13 18:52:41,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 949. [2021-07-13 18:52:41,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 948 states have (on average 2.782700421940928) internal successors, (2638), 948 states have internal predecessors, (2638), 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-07-13 18:52:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2638 transitions. [2021-07-13 18:52:41,496 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 2638 transitions. Word has length 80 [2021-07-13 18:52:41,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:52:41,496 INFO L482 AbstractCegarLoop]: Abstraction has 949 states and 2638 transitions. [2021-07-13 18:52:41,496 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 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-07-13 18:52:41,496 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 2638 transitions. [2021-07-13 18:52:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-07-13 18:52:41,499 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:52:41,499 INFO L508 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-07-13 18:52:41,499 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-07-13 18:52:41,499 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:52:41,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:52:41,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1422509713, now seen corresponding path program 3 times [2021-07-13 18:52:41,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:52:41,500 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242008685] [2021-07-13 18:52:41,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:52:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-13 18:52:41,536 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-13 18:52:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-13 18:52:41,575 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-13 18:52:41,606 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-13 18:52:41,606 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-13 18:52:41,607 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-07-13 18:52:41,607 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/2) [2021-07-13 18:52:41,609 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-13 18:52:41,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 06:52:41 BasicIcfg [2021-07-13 18:52:41,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-13 18:52:41,707 INFO L168 Benchmark]: Toolchain (without parser) took 14573.89 ms. Allocated memory was 213.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 178.2 MB in the beginning and 632.6 MB in the end (delta: -454.5 MB). Peak memory consumption was 649.3 MB. Max. memory is 8.0 GB. [2021-07-13 18:52:41,707 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 213.9 MB. Free memory is still 196.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-13 18:52:41,707 INFO L168 Benchmark]: CACSL2BoogieTranslator took 588.83 ms. Allocated memory is still 213.9 MB. Free memory was 178.0 MB in the beginning and 187.2 MB in the end (delta: -9.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. [2021-07-13 18:52:41,707 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.40 ms. Allocated memory is still 213.9 MB. Free memory was 187.2 MB in the beginning and 184.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-13 18:52:41,707 INFO L168 Benchmark]: Boogie Preprocessor took 40.96 ms. Allocated memory is still 213.9 MB. Free memory was 184.2 MB in the beginning and 182.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-13 18:52:41,707 INFO L168 Benchmark]: RCFGBuilder took 1808.90 ms. Allocated memory was 213.9 MB in the beginning and 256.9 MB in the end (delta: 43.0 MB). Free memory was 182.1 MB in the beginning and 136.7 MB in the end (delta: 45.4 MB). Peak memory consumption was 90.4 MB. Max. memory is 8.0 GB. [2021-07-13 18:52:41,708 INFO L168 Benchmark]: TraceAbstraction took 12071.96 ms. Allocated memory was 256.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 136.7 MB in the beginning and 632.6 MB in the end (delta: -495.9 MB). Peak memory consumption was 564.2 MB. Max. memory is 8.0 GB. [2021-07-13 18:52:41,708 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 213.9 MB. Free memory is still 196.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 588.83 ms. Allocated memory is still 213.9 MB. Free memory was 178.0 MB in the beginning and 187.2 MB in the end (delta: -9.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 55.40 ms. Allocated memory is still 213.9 MB. Free memory was 187.2 MB in the beginning and 184.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 40.96 ms. Allocated memory is still 213.9 MB. Free memory was 184.2 MB in the beginning and 182.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1808.90 ms. Allocated memory was 213.9 MB in the beginning and 256.9 MB in the end (delta: 43.0 MB). Free memory was 182.1 MB in the beginning and 136.7 MB in the end (delta: 45.4 MB). Peak memory consumption was 90.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 12071.96 ms. Allocated memory was 256.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 136.7 MB in the beginning and 632.6 MB in the end (delta: -495.9 MB). Peak memory consumption was 564.2 MB. 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 t2192; 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(&t2192, ((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 t2193; 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(&t2193, ((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 t2194; 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(&t2194, ((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] EXPR 0 !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] 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] EXPR 0 !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] 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] EXPR 0 !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] 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] EXPR 0 !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] 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] EXPR 0 !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] 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] EXPR 0 !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] 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=50, weak$$choice2=0, 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=50, weak$$choice2=0, 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=50, weak$$choice2=0, 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 for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11856.8ms, OverallIterations: 18, TraceHistogramMax: 1, EmptinessCheckTime: 254.4ms, AutomataDifference: 5097.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 304.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2266 SDtfs, 3518 SDslu, 9489 SDs, 0 SdLazy, 1561 SolverSat, 324 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1571.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 265 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 2888.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=8606occurred in iteration=0, InterpolantAutomatonStates: 202, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2672.7ms AutomataMinimizationTime, 17 MinimizatonAttempts, 3196 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 118.4ms SsaConstructionTime, 719.2ms SatisfiabilityAnalysisTime, 2357.9ms InterpolantComputationTime, 1320 NumberOfCodeBlocks, 1320 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1223 ConstructedInterpolants, 0 QuantifiedInterpolants, 7251 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...