/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/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-08 23:55:12,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-08 23:55:12,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-08 23:55:12,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-08 23:55:12,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-08 23:55:12,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-08 23:55:12,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-08 23:55:12,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-08 23:55:12,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-08 23:55:12,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-08 23:55:12,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-08 23:55:12,735 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-08 23:55:12,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-08 23:55:12,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-08 23:55:12,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-08 23:55:12,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-08 23:55:12,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-08 23:55:12,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-08 23:55:12,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-08 23:55:12,745 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-08 23:55:12,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-08 23:55:12,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-08 23:55:12,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-08 23:55:12,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-08 23:55:12,754 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-08 23:55:12,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-08 23:55:12,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-08 23:55:12,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-08 23:55:12,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-08 23:55:12,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-08 23:55:12,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-08 23:55:12,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-08 23:55:12,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-08 23:55:12,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-08 23:55:12,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-08 23:55:12,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-08 23:55:12,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-08 23:55:12,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-08 23:55:12,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-08 23:55:12,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-08 23:55:12,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-08 23:55:12,765 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 [2022-02-08 23:55:12,784 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-08 23:55:12,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-08 23:55:12,784 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-08 23:55:12,784 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-08 23:55:12,785 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-08 23:55:12,785 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-08 23:55:12,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-08 23:55:12,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-08 23:55:12,785 INFO L138 SettingsManager]: * Use SBE=true [2022-02-08 23:55:12,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-08 23:55:12,785 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-08 23:55:12,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-08 23:55:12,786 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-08 23:55:12,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-08 23:55:12,786 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-08 23:55:12,786 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-08 23:55:12,786 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-08 23:55:12,786 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-08 23:55:12,786 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-08 23:55:12,786 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-08 23:55:12,786 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-08 23:55:12,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-08 23:55:12,786 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-08 23:55:12,787 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-08 23:55:12,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-08 23:55:12,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-08 23:55:12,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-08 23:55:12,787 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-08 23:55:12,787 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-08 23:55:12,787 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-08 23:55:12,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-08 23:55:12,787 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-08 23:55:12,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-08 23:55:12,787 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 [2022-02-08 23:55:12,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-08 23:55:12,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-08 23:55:12,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-08 23:55:12,999 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-08 23:55:13,001 INFO L275 PluginConnector]: CDTParser initialized [2022-02-08 23:55:13,002 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-02-08 23:55:13,063 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/343c13a36/5fa7c82ab18c4ddd973d44053ed827be/FLAG222027434 [2022-02-08 23:55:13,457 INFO L306 CDTParser]: Found 1 translation units. [2022-02-08 23:55:13,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-02-08 23:55:13,468 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/343c13a36/5fa7c82ab18c4ddd973d44053ed827be/FLAG222027434 [2022-02-08 23:55:13,479 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/343c13a36/5fa7c82ab18c4ddd973d44053ed827be [2022-02-08 23:55:13,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-08 23:55:13,482 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-08 23:55:13,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-08 23:55:13,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-08 23:55:13,493 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-08 23:55:13,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 11:55:13" (1/1) ... [2022-02-08 23:55:13,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24d37cbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:55:13, skipping insertion in model container [2022-02-08 23:55:13,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 11:55:13" (1/1) ... [2022-02-08 23:55:13,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-08 23:55:13,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-08 23:55:13,692 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-02-08 23:55:13,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-08 23:55:13,786 INFO L203 MainTranslator]: Completed pre-run [2022-02-08 23:55:13,796 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-02-08 23:55:13,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-08 23:55:13,885 INFO L208 MainTranslator]: Completed translation [2022-02-08 23:55:13,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:55:13 WrapperNode [2022-02-08 23:55:13,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-08 23:55:13,886 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-08 23:55:13,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-08 23:55:13,887 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-08 23:55:13,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:55:13" (1/1) ... [2022-02-08 23:55:13,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:55:13" (1/1) ... [2022-02-08 23:55:13,936 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 297 [2022-02-08 23:55:13,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-08 23:55:13,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-08 23:55:13,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-08 23:55:13,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-08 23:55:13,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:55:13" (1/1) ... [2022-02-08 23:55:13,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:55:13" (1/1) ... [2022-02-08 23:55:13,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:55:13" (1/1) ... [2022-02-08 23:55:13,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:55:13" (1/1) ... [2022-02-08 23:55:13,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:55:13" (1/1) ... [2022-02-08 23:55:13,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:55:13" (1/1) ... [2022-02-08 23:55:13,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:55:13" (1/1) ... [2022-02-08 23:55:14,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-08 23:55:14,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-08 23:55:14,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-08 23:55:14,005 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-08 23:55:14,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:55:13" (1/1) ... [2022-02-08 23:55:14,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-08 23:55:14,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-08 23:55:14,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-08 23:55:14,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-08 23:55:14,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-08 23:55:14,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-08 23:55:14,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-08 23:55:14,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-08 23:55:14,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-08 23:55:14,054 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-02-08 23:55:14,054 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-02-08 23:55:14,054 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-02-08 23:55:14,054 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-02-08 23:55:14,054 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-02-08 23:55:14,054 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-02-08 23:55:14,055 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-02-08 23:55:14,055 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-02-08 23:55:14,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-08 23:55:14,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-08 23:55:14,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-08 23:55:14,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-08 23:55:14,056 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-08 23:55:14,170 INFO L234 CfgBuilder]: Building ICFG [2022-02-08 23:55:14,177 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-08 23:55:14,490 INFO L275 CfgBuilder]: Performing block encoding [2022-02-08 23:55:14,699 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-08 23:55:14,699 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-08 23:55:14,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.02 11:55:14 BoogieIcfgContainer [2022-02-08 23:55:14,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-08 23:55:14,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-08 23:55:14,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-08 23:55:14,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-08 23:55:14,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 11:55:13" (1/3) ... [2022-02-08 23:55:14,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc64eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 11:55:14, skipping insertion in model container [2022-02-08 23:55:14,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:55:13" (2/3) ... [2022-02-08 23:55:14,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc64eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 11:55:14, skipping insertion in model container [2022-02-08 23:55:14,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.02 11:55:14" (3/3) ... [2022-02-08 23:55:14,707 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-02-08 23:55:14,710 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-08 23:55:14,710 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-08 23:55:14,711 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-08 23:55:14,711 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-08 23:55:14,751 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,751 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,752 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,752 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,752 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,753 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,753 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,753 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,754 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,754 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,754 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,754 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,754 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,755 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,755 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,755 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,755 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,755 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,755 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,756 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,756 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,756 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,756 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,756 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,757 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,757 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,757 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,757 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,757 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,757 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,757 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,757 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,758 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,758 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,758 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,758 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,758 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,758 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,758 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,759 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,759 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,759 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,759 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,759 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,759 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,759 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,760 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,760 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,760 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,760 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,760 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,760 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,760 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,760 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,761 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,761 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,761 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,761 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,761 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,761 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,761 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,761 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,761 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,761 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,762 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,762 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,762 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,762 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,762 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,762 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,762 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,763 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,763 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,763 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,763 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,763 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,763 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,763 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,764 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,764 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,764 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,764 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,764 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,765 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,768 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,768 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,769 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,770 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,774 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,774 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,774 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,774 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,775 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,775 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,776 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,776 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,776 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,776 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,776 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,776 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,776 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,776 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,776 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,776 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,777 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,777 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,777 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,778 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,778 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,778 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,778 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,778 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,778 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,778 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:55:14,779 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-08 23:55:14,821 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-08 23:55:14,825 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-08 23:55:14,826 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-08 23:55:14,837 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147 places, 136 transitions, 292 flow [2022-02-08 23:55:18,158 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 102751 states, 102748 states have (on average 4.4352396153696425) internal successors, (455712), 102750 states have internal predecessors, (455712), 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) [2022-02-08 23:55:18,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 102751 states, 102748 states have (on average 4.4352396153696425) internal successors, (455712), 102750 states have internal predecessors, (455712), 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) [2022-02-08 23:55:18,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-08 23:55:18,396 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:55:18,397 INFO L514 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] [2022-02-08 23:55:18,398 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-08 23:55:18,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:55:18,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2132212955, now seen corresponding path program 1 times [2022-02-08 23:55:18,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:55:18,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760653826] [2022-02-08 23:55:18,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:55:18,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:55:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:55:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:55:18,872 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:55:18,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760653826] [2022-02-08 23:55:18,872 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760653826] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:55:18,873 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:55:18,873 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-08 23:55:18,874 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932563799] [2022-02-08 23:55:18,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:55:18,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-08 23:55:18,877 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:55:18,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-08 23:55:18,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-08 23:55:19,160 INFO L87 Difference]: Start difference. First operand has 102751 states, 102748 states have (on average 4.4352396153696425) internal successors, (455712), 102750 states have internal predecessors, (455712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 35.0) internal successors, (70), 3 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) [2022-02-08 23:55:20,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:55:20,761 INFO L93 Difference]: Finished difference Result 88639 states and 386244 transitions. [2022-02-08 23:55:20,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-08 23:55:20,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 35.0) internal successors, (70), 3 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 [2022-02-08 23:55:20,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:55:21,391 INFO L225 Difference]: With dead ends: 88639 [2022-02-08 23:55:21,392 INFO L226 Difference]: Without dead ends: 73743 [2022-02-08 23:55:21,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-08 23:55:21,399 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 48 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-08 23:55:21,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 192 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-08 23:55:21,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73743 states. [2022-02-08 23:55:24,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73743 to 73743. [2022-02-08 23:55:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73743 states, 73742 states have (on average 4.390469474654878) internal successors, (323762), 73742 states have internal predecessors, (323762), 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) [2022-02-08 23:55:25,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73743 states to 73743 states and 323762 transitions. [2022-02-08 23:55:25,466 INFO L78 Accepts]: Start accepts. Automaton has 73743 states and 323762 transitions. Word has length 70 [2022-02-08 23:55:25,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:55:25,467 INFO L470 AbstractCegarLoop]: Abstraction has 73743 states and 323762 transitions. [2022-02-08 23:55:25,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 35.0) internal successors, (70), 3 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) [2022-02-08 23:55:25,467 INFO L276 IsEmpty]: Start isEmpty. Operand 73743 states and 323762 transitions. [2022-02-08 23:55:25,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-02-08 23:55:25,550 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:55:25,551 INFO L514 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, 1, 1, 1, 1, 1] [2022-02-08 23:55:25,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-08 23:55:25,551 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-08 23:55:25,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:55:25,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1153384263, now seen corresponding path program 1 times [2022-02-08 23:55:25,553 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:55:25,554 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267753798] [2022-02-08 23:55:25,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:55:25,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:55:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:55:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:55:25,775 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:55:25,775 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267753798] [2022-02-08 23:55:25,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267753798] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:55:25,776 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:55:25,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-08 23:55:25,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90121516] [2022-02-08 23:55:25,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:55:25,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-08 23:55:25,777 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:55:25,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-08 23:55:25,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-08 23:55:25,778 INFO L87 Difference]: Start difference. First operand 73743 states and 323762 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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) [2022-02-08 23:55:27,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:55:27,022 INFO L93 Difference]: Finished difference Result 82367 states and 359028 transitions. [2022-02-08 23:55:27,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-08 23:55:27,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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 85 [2022-02-08 23:55:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:55:27,500 INFO L225 Difference]: With dead ends: 82367 [2022-02-08 23:55:27,500 INFO L226 Difference]: Without dead ends: 62767 [2022-02-08 23:55:27,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-08 23:55:27,502 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 176 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:55:27,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 666 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:55:27,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62767 states. [2022-02-08 23:55:29,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62767 to 62767. [2022-02-08 23:55:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62767 states, 62766 states have (on average 4.3557021317273685) internal successors, (273390), 62766 states have internal predecessors, (273390), 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) [2022-02-08 23:55:30,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62767 states to 62767 states and 273390 transitions. [2022-02-08 23:55:30,338 INFO L78 Accepts]: Start accepts. Automaton has 62767 states and 273390 transitions. Word has length 85 [2022-02-08 23:55:30,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:55:30,338 INFO L470 AbstractCegarLoop]: Abstraction has 62767 states and 273390 transitions. [2022-02-08 23:55:30,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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) [2022-02-08 23:55:30,339 INFO L276 IsEmpty]: Start isEmpty. Operand 62767 states and 273390 transitions. [2022-02-08 23:55:30,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-02-08 23:55:30,492 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:55:30,493 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:55:30,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-08 23:55:30,493 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-08 23:55:30,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:55:30,497 INFO L85 PathProgramCache]: Analyzing trace with hash -368329848, now seen corresponding path program 1 times [2022-02-08 23:55:30,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:55:30,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107538440] [2022-02-08 23:55:30,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:55:30,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:55:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:55:30,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:55:30,660 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:55:30,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107538440] [2022-02-08 23:55:30,660 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107538440] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:55:30,661 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:55:30,661 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-08 23:55:30,661 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385911537] [2022-02-08 23:55:30,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:55:30,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-08 23:55:30,662 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:55:30,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-08 23:55:30,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-08 23:55:30,663 INFO L87 Difference]: Start difference. First operand 62767 states and 273390 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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) [2022-02-08 23:55:31,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:55:31,593 INFO L93 Difference]: Finished difference Result 72763 states and 315026 transitions. [2022-02-08 23:55:31,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-08 23:55:31,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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 89 [2022-02-08 23:55:31,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:55:32,265 INFO L225 Difference]: With dead ends: 72763 [2022-02-08 23:55:32,266 INFO L226 Difference]: Without dead ends: 61003 [2022-02-08 23:55:32,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-08 23:55:32,271 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 147 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-08 23:55:32,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 666 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-08 23:55:32,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61003 states. [2022-02-08 23:55:34,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61003 to 61003. [2022-02-08 23:55:34,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61003 states, 61002 states have (on average 4.3460214419199374) internal successors, (265116), 61002 states have internal predecessors, (265116), 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) [2022-02-08 23:55:34,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61003 states to 61003 states and 265116 transitions. [2022-02-08 23:55:34,897 INFO L78 Accepts]: Start accepts. Automaton has 61003 states and 265116 transitions. Word has length 89 [2022-02-08 23:55:34,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:55:34,897 INFO L470 AbstractCegarLoop]: Abstraction has 61003 states and 265116 transitions. [2022-02-08 23:55:34,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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) [2022-02-08 23:55:34,897 INFO L276 IsEmpty]: Start isEmpty. Operand 61003 states and 265116 transitions. [2022-02-08 23:55:35,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-08 23:55:35,025 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:55:35,025 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:55:35,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-08 23:55:35,026 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-08 23:55:35,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:55:35,026 INFO L85 PathProgramCache]: Analyzing trace with hash 738217609, now seen corresponding path program 1 times [2022-02-08 23:55:35,026 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:55:35,026 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092069805] [2022-02-08 23:55:35,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:55:35,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:55:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:55:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:55:35,147 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:55:35,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092069805] [2022-02-08 23:55:35,148 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092069805] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:55:35,148 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:55:35,148 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-08 23:55:35,148 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983546498] [2022-02-08 23:55:35,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:55:35,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-08 23:55:35,148 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:55:35,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-08 23:55:35,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-08 23:55:35,149 INFO L87 Difference]: Start difference. First operand 61003 states and 265116 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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) [2022-02-08 23:55:36,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:55:36,024 INFO L93 Difference]: Finished difference Result 68311 states and 295152 transitions. [2022-02-08 23:55:36,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-08 23:55:36,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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 91 [2022-02-08 23:55:36,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:55:36,396 INFO L225 Difference]: With dead ends: 68311 [2022-02-08 23:55:36,397 INFO L226 Difference]: Without dead ends: 59491 [2022-02-08 23:55:36,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-08 23:55:36,398 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 137 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:55:36,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 653 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:55:36,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59491 states. [2022-02-08 23:55:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59491 to 59491. [2022-02-08 23:55:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59491 states, 59490 states have (on average 4.337871911245587) internal successors, (258060), 59490 states have internal predecessors, (258060), 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) [2022-02-08 23:55:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59491 states to 59491 states and 258060 transitions. [2022-02-08 23:55:38,824 INFO L78 Accepts]: Start accepts. Automaton has 59491 states and 258060 transitions. Word has length 91 [2022-02-08 23:55:38,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:55:38,825 INFO L470 AbstractCegarLoop]: Abstraction has 59491 states and 258060 transitions. [2022-02-08 23:55:38,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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) [2022-02-08 23:55:38,825 INFO L276 IsEmpty]: Start isEmpty. Operand 59491 states and 258060 transitions. [2022-02-08 23:55:39,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-08 23:55:39,273 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:55:39,273 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:55:39,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-08 23:55:39,273 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-08 23:55:39,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:55:39,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1643151847, now seen corresponding path program 1 times [2022-02-08 23:55:39,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:55:39,276 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307876432] [2022-02-08 23:55:39,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:55:39,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:55:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:55:39,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:55:39,423 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:55:39,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307876432] [2022-02-08 23:55:39,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307876432] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:55:39,423 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:55:39,423 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-08 23:55:39,424 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118694239] [2022-02-08 23:55:39,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:55:39,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-08 23:55:39,424 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:55:39,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-08 23:55:39,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-08 23:55:39,425 INFO L87 Difference]: Start difference. First operand 59491 states and 258060 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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) [2022-02-08 23:55:40,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:55:40,498 INFO L93 Difference]: Finished difference Result 95611 states and 408874 transitions. [2022-02-08 23:55:40,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-08 23:55:40,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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 92 [2022-02-08 23:55:40,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:55:40,807 INFO L225 Difference]: With dead ends: 95611 [2022-02-08 23:55:40,807 INFO L226 Difference]: Without dead ends: 64195 [2022-02-08 23:55:40,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-08 23:55:40,808 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 148 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:55:40,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 869 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:55:41,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64195 states. [2022-02-08 23:55:42,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64195 to 57139. [2022-02-08 23:55:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57139 states, 57138 states have (on average 4.247646049914243) internal successors, (242702), 57138 states have internal predecessors, (242702), 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) [2022-02-08 23:55:43,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57139 states to 57139 states and 242702 transitions. [2022-02-08 23:55:43,369 INFO L78 Accepts]: Start accepts. Automaton has 57139 states and 242702 transitions. Word has length 92 [2022-02-08 23:55:43,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:55:43,370 INFO L470 AbstractCegarLoop]: Abstraction has 57139 states and 242702 transitions. [2022-02-08 23:55:43,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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) [2022-02-08 23:55:43,370 INFO L276 IsEmpty]: Start isEmpty. Operand 57139 states and 242702 transitions. [2022-02-08 23:55:43,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-08 23:55:43,484 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:55:43,484 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:55:43,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-08 23:55:43,485 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-08 23:55:43,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:55:43,485 INFO L85 PathProgramCache]: Analyzing trace with hash -415832408, now seen corresponding path program 1 times [2022-02-08 23:55:43,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:55:43,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823444189] [2022-02-08 23:55:43,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:55:43,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:55:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:55:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:55:43,716 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:55:43,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823444189] [2022-02-08 23:55:43,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823444189] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:55:43,717 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:55:43,717 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-08 23:55:43,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944585278] [2022-02-08 23:55:43,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:55:43,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-08 23:55:43,718 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:55:43,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-08 23:55:43,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-08 23:55:43,718 INFO L87 Difference]: Start difference. First operand 57139 states and 242702 transitions. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 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) [2022-02-08 23:55:44,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:55:44,833 INFO L93 Difference]: Finished difference Result 67623 states and 286742 transitions. [2022-02-08 23:55:44,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-08 23:55:44,834 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 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 93 [2022-02-08 23:55:44,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:55:45,412 INFO L225 Difference]: With dead ends: 67623 [2022-02-08 23:55:45,412 INFO L226 Difference]: Without dead ends: 59883 [2022-02-08 23:55:45,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2022-02-08 23:55:45,413 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 355 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:55:45,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [355 Valid, 1212 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:55:45,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59883 states. [2022-02-08 23:55:47,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59883 to 59883. [2022-02-08 23:55:47,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59883 states, 59882 states have (on average 4.250325640426172) internal successors, (254518), 59882 states have internal predecessors, (254518), 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) [2022-02-08 23:55:47,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59883 states to 59883 states and 254518 transitions. [2022-02-08 23:55:47,883 INFO L78 Accepts]: Start accepts. Automaton has 59883 states and 254518 transitions. Word has length 93 [2022-02-08 23:55:47,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:55:47,884 INFO L470 AbstractCegarLoop]: Abstraction has 59883 states and 254518 transitions. [2022-02-08 23:55:47,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 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) [2022-02-08 23:55:47,884 INFO L276 IsEmpty]: Start isEmpty. Operand 59883 states and 254518 transitions. [2022-02-08 23:55:48,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-08 23:55:48,391 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:55:48,391 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:55:48,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-08 23:55:48,392 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-08 23:55:48,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:55:48,392 INFO L85 PathProgramCache]: Analyzing trace with hash -332227616, now seen corresponding path program 2 times [2022-02-08 23:55:48,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:55:48,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299853110] [2022-02-08 23:55:48,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:55:48,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:55:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:55:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:55:48,666 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:55:48,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299853110] [2022-02-08 23:55:48,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299853110] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:55:48,666 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:55:48,666 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-08 23:55:48,666 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278736289] [2022-02-08 23:55:48,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:55:48,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-08 23:55:48,667 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:55:48,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-08 23:55:48,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-02-08 23:55:48,667 INFO L87 Difference]: Start difference. First operand 59883 states and 254518 transitions. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 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) [2022-02-08 23:55:49,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:55:49,800 INFO L93 Difference]: Finished difference Result 67021 states and 283842 transitions. [2022-02-08 23:55:49,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-08 23:55:49,816 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 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 93 [2022-02-08 23:55:49,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:55:50,154 INFO L225 Difference]: With dead ends: 67021 [2022-02-08 23:55:50,154 INFO L226 Difference]: Without dead ends: 59281 [2022-02-08 23:55:50,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-02-08 23:55:50,155 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 369 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:55:50,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 863 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:55:50,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59281 states. [2022-02-08 23:55:51,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59281 to 59281. [2022-02-08 23:55:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59281 states, 59280 states have (on average 4.246018893387315) internal successors, (251704), 59280 states have internal predecessors, (251704), 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) [2022-02-08 23:55:52,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59281 states to 59281 states and 251704 transitions. [2022-02-08 23:55:52,625 INFO L78 Accepts]: Start accepts. Automaton has 59281 states and 251704 transitions. Word has length 93 [2022-02-08 23:55:52,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:55:52,625 INFO L470 AbstractCegarLoop]: Abstraction has 59281 states and 251704 transitions. [2022-02-08 23:55:52,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 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) [2022-02-08 23:55:52,626 INFO L276 IsEmpty]: Start isEmpty. Operand 59281 states and 251704 transitions. [2022-02-08 23:55:52,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-02-08 23:55:52,761 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:55:52,761 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:55:52,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-08 23:55:52,762 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-08 23:55:52,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:55:52,763 INFO L85 PathProgramCache]: Analyzing trace with hash -441785634, now seen corresponding path program 1 times [2022-02-08 23:55:52,763 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:55:52,763 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976378785] [2022-02-08 23:55:52,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:55:52,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:55:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:55:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:55:52,915 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:55:52,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976378785] [2022-02-08 23:55:52,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976378785] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:55:52,916 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:55:52,916 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-08 23:55:52,916 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530017143] [2022-02-08 23:55:52,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:55:52,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-08 23:55:52,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:55:52,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-08 23:55:52,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-08 23:55:52,917 INFO L87 Difference]: Start difference. First operand 59281 states and 251704 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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) [2022-02-08 23:55:53,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:55:53,873 INFO L93 Difference]: Finished difference Result 69777 states and 295269 transitions. [2022-02-08 23:55:53,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-08 23:55:53,873 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 94 [2022-02-08 23:55:53,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:55:54,168 INFO L225 Difference]: With dead ends: 69777 [2022-02-08 23:55:54,168 INFO L226 Difference]: Without dead ends: 63327 [2022-02-08 23:55:54,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-02-08 23:55:54,170 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 217 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:55:54,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 1303 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:55:54,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63327 states. [2022-02-08 23:55:55,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63327 to 57419. [2022-02-08 23:55:56,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57419 states, 57418 states have (on average 4.233759448256644) internal successors, (243094), 57418 states have internal predecessors, (243094), 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) [2022-02-08 23:55:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57419 states to 57419 states and 243094 transitions. [2022-02-08 23:55:56,547 INFO L78 Accepts]: Start accepts. Automaton has 57419 states and 243094 transitions. Word has length 94 [2022-02-08 23:55:56,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:55:56,548 INFO L470 AbstractCegarLoop]: Abstraction has 57419 states and 243094 transitions. [2022-02-08 23:55:56,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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) [2022-02-08 23:55:56,548 INFO L276 IsEmpty]: Start isEmpty. Operand 57419 states and 243094 transitions. [2022-02-08 23:55:56,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-02-08 23:55:56,667 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:55:56,667 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:55:56,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-08 23:55:56,668 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-08 23:55:56,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:55:56,669 INFO L85 PathProgramCache]: Analyzing trace with hash -358180842, now seen corresponding path program 2 times [2022-02-08 23:55:56,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:55:56,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256537967] [2022-02-08 23:55:56,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:55:56,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:55:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:55:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:55:56,871 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:55:56,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256537967] [2022-02-08 23:55:56,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256537967] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:55:56,871 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:55:56,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-08 23:55:56,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112766452] [2022-02-08 23:55:56,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:55:56,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-08 23:55:56,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:55:56,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-08 23:55:56,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-02-08 23:55:56,873 INFO L87 Difference]: Start difference. First operand 57419 states and 243094 transitions. Second operand has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 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) [2022-02-08 23:55:57,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:55:57,839 INFO L93 Difference]: Finished difference Result 76565 states and 324129 transitions. [2022-02-08 23:55:57,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-08 23:55:57,840 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 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 94 [2022-02-08 23:55:57,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:55:58,428 INFO L225 Difference]: With dead ends: 76565 [2022-02-08 23:55:58,428 INFO L226 Difference]: Without dead ends: 68395 [2022-02-08 23:55:58,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-02-08 23:55:58,429 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 312 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:55:58,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 1466 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:55:58,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68395 states. [2022-02-08 23:56:00,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68395 to 65945. [2022-02-08 23:56:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65945 states, 65944 states have (on average 4.234320029115613) internal successors, (279228), 65944 states have internal predecessors, (279228), 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) [2022-02-08 23:56:00,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65945 states to 65945 states and 279228 transitions. [2022-02-08 23:56:00,950 INFO L78 Accepts]: Start accepts. Automaton has 65945 states and 279228 transitions. Word has length 94 [2022-02-08 23:56:00,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:56:00,951 INFO L470 AbstractCegarLoop]: Abstraction has 65945 states and 279228 transitions. [2022-02-08 23:56:00,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 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) [2022-02-08 23:56:00,951 INFO L276 IsEmpty]: Start isEmpty. Operand 65945 states and 279228 transitions. [2022-02-08 23:56:01,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-02-08 23:56:01,125 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:56:01,125 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:56:01,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-08 23:56:01,125 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-08 23:56:01,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:56:01,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1555436880, now seen corresponding path program 3 times [2022-02-08 23:56:01,126 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:56:01,126 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130187783] [2022-02-08 23:56:01,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:56:01,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:56:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:56:01,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:56:01,287 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:56:01,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130187783] [2022-02-08 23:56:01,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130187783] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:56:01,287 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:56:01,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-08 23:56:01,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144942688] [2022-02-08 23:56:01,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:56:01,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-08 23:56:01,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:56:01,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-08 23:56:01,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-08 23:56:01,289 INFO L87 Difference]: Start difference. First operand 65945 states and 279228 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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) [2022-02-08 23:56:02,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:56:02,303 INFO L93 Difference]: Finished difference Result 76013 states and 321076 transitions. [2022-02-08 23:56:02,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-08 23:56:02,304 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 94 [2022-02-08 23:56:02,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:56:02,614 INFO L225 Difference]: With dead ends: 76013 [2022-02-08 23:56:02,614 INFO L226 Difference]: Without dead ends: 68703 [2022-02-08 23:56:02,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-02-08 23:56:02,615 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 381 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:56:02,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 1011 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:56:02,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68703 states. [2022-02-08 23:56:04,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68703 to 66715. [2022-02-08 23:56:04,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66715 states, 66714 states have (on average 4.237176604610727) internal successors, (282679), 66714 states have internal predecessors, (282679), 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) [2022-02-08 23:56:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66715 states to 66715 states and 282679 transitions. [2022-02-08 23:56:05,109 INFO L78 Accepts]: Start accepts. Automaton has 66715 states and 282679 transitions. Word has length 94 [2022-02-08 23:56:05,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:56:05,110 INFO L470 AbstractCegarLoop]: Abstraction has 66715 states and 282679 transitions. [2022-02-08 23:56:05,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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) [2022-02-08 23:56:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand 66715 states and 282679 transitions. [2022-02-08 23:56:05,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-08 23:56:05,593 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:56:05,600 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:56:05,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-08 23:56:05,600 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-08 23:56:05,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:56:05,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1766770221, now seen corresponding path program 1 times [2022-02-08 23:56:05,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:56:05,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535229220] [2022-02-08 23:56:05,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:56:05,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:56:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:56:05,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:56:05,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:56:05,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535229220] [2022-02-08 23:56:05,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535229220] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:56:05,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:56:05,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-08 23:56:05,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275650660] [2022-02-08 23:56:05,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:56:05,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-08 23:56:05,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:56:05,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-08 23:56:05,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-08 23:56:05,774 INFO L87 Difference]: Start difference. First operand 66715 states and 282679 transitions. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 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) [2022-02-08 23:56:06,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:56:06,888 INFO L93 Difference]: Finished difference Result 82753 states and 350455 transitions. [2022-02-08 23:56:06,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-08 23:56:06,888 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 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 95 [2022-02-08 23:56:06,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:56:07,534 INFO L225 Difference]: With dead ends: 82753 [2022-02-08 23:56:07,536 INFO L226 Difference]: Without dead ends: 77593 [2022-02-08 23:56:07,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2022-02-08 23:56:07,537 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 308 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:56:07,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 1568 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:56:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77593 states. [2022-02-08 23:56:09,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77593 to 68969. [2022-02-08 23:56:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68969 states, 68968 states have (on average 4.243837721842014) internal successors, (292689), 68968 states have internal predecessors, (292689), 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) [2022-02-08 23:56:10,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68969 states to 68969 states and 292689 transitions. [2022-02-08 23:56:10,430 INFO L78 Accepts]: Start accepts. Automaton has 68969 states and 292689 transitions. Word has length 95 [2022-02-08 23:56:10,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:56:10,430 INFO L470 AbstractCegarLoop]: Abstraction has 68969 states and 292689 transitions. [2022-02-08 23:56:10,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 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) [2022-02-08 23:56:10,431 INFO L276 IsEmpty]: Start isEmpty. Operand 68969 states and 292689 transitions. [2022-02-08 23:56:10,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-08 23:56:10,584 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:56:10,584 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:56:10,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-08 23:56:10,584 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-08 23:56:10,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:56:10,584 INFO L85 PathProgramCache]: Analyzing trace with hash 554373369, now seen corresponding path program 2 times [2022-02-08 23:56:10,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:56:10,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93174070] [2022-02-08 23:56:10,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:56:10,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:56:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:56:11,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:56:11,130 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:56:11,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93174070] [2022-02-08 23:56:11,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93174070] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:56:11,130 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:56:11,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-08 23:56:11,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760199014] [2022-02-08 23:56:11,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:56:11,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-08 23:56:11,131 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:56:11,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-08 23:56:11,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-02-08 23:56:11,131 INFO L87 Difference]: Start difference. First operand 68969 states and 292689 transitions. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 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) [2022-02-08 23:56:11,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:56:11,996 INFO L93 Difference]: Finished difference Result 75109 states and 317275 transitions. [2022-02-08 23:56:11,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-08 23:56:11,997 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 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 95 [2022-02-08 23:56:11,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:56:12,351 INFO L225 Difference]: With dead ends: 75109 [2022-02-08 23:56:12,352 INFO L226 Difference]: Without dead ends: 69949 [2022-02-08 23:56:12,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2022-02-08 23:56:12,352 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 414 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:56:12,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [414 Valid, 1207 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:56:12,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69949 states. [2022-02-08 23:56:14,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69949 to 68871. [2022-02-08 23:56:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68871 states, 68870 states have (on average 4.244794540438507) internal successors, (292339), 68870 states have internal predecessors, (292339), 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) [2022-02-08 23:56:14,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68871 states to 68871 states and 292339 transitions. [2022-02-08 23:56:14,847 INFO L78 Accepts]: Start accepts. Automaton has 68871 states and 292339 transitions. Word has length 95 [2022-02-08 23:56:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:56:14,847 INFO L470 AbstractCegarLoop]: Abstraction has 68871 states and 292339 transitions. [2022-02-08 23:56:14,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 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) [2022-02-08 23:56:14,847 INFO L276 IsEmpty]: Start isEmpty. Operand 68871 states and 292339 transitions. [2022-02-08 23:56:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-08 23:56:15,020 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:56:15,020 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:56:15,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-08 23:56:15,021 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-08 23:56:15,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:56:15,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1092595625, now seen corresponding path program 3 times [2022-02-08 23:56:15,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:56:15,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534382605] [2022-02-08 23:56:15,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:56:15,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:56:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:56:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:56:15,174 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:56:15,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534382605] [2022-02-08 23:56:15,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534382605] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:56:15,175 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:56:15,175 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-08 23:56:15,175 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187284109] [2022-02-08 23:56:15,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:56:15,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-08 23:56:15,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:56:15,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-08 23:56:15,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-02-08 23:56:15,176 INFO L87 Difference]: Start difference. First operand 68871 states and 292339 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 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) [2022-02-08 23:56:16,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:56:16,539 INFO L93 Difference]: Finished difference Result 89707 states and 376226 transitions. [2022-02-08 23:56:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-08 23:56:16,541 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 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 95 [2022-02-08 23:56:16,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:56:16,908 INFO L225 Difference]: With dead ends: 89707 [2022-02-08 23:56:16,908 INFO L226 Difference]: Without dead ends: 70327 [2022-02-08 23:56:16,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2022-02-08 23:56:16,909 INFO L933 BasicCegarLoop]: 226 mSDtfsCounter, 316 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:56:16,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 1229 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:56:17,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70327 states. [2022-02-08 23:56:18,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70327 to 53527. [2022-02-08 23:56:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53527 states, 53526 states have (on average 4.18981429585622) internal successors, (224264), 53526 states have internal predecessors, (224264), 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) [2022-02-08 23:56:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53527 states to 53527 states and 224264 transitions. [2022-02-08 23:56:18,963 INFO L78 Accepts]: Start accepts. Automaton has 53527 states and 224264 transitions. Word has length 95 [2022-02-08 23:56:18,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:56:18,964 INFO L470 AbstractCegarLoop]: Abstraction has 53527 states and 224264 transitions. [2022-02-08 23:56:18,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 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) [2022-02-08 23:56:18,964 INFO L276 IsEmpty]: Start isEmpty. Operand 53527 states and 224264 transitions. [2022-02-08 23:56:19,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-08 23:56:19,386 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:56:19,386 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:56:19,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-08 23:56:19,387 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-08 23:56:19,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:56:19,387 INFO L85 PathProgramCache]: Analyzing trace with hash 2110016135, now seen corresponding path program 1 times [2022-02-08 23:56:19,387 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:56:19,387 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980344655] [2022-02-08 23:56:19,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:56:19,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:56:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:56:19,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:56:19,474 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:56:19,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980344655] [2022-02-08 23:56:19,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980344655] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:56:19,474 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:56:19,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-08 23:56:19,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880280894] [2022-02-08 23:56:19,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:56:19,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-08 23:56:19,474 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:56:19,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-08 23:56:19,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-08 23:56:19,475 INFO L87 Difference]: Start difference. First operand 53527 states and 224264 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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) [2022-02-08 23:56:20,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:56:20,338 INFO L93 Difference]: Finished difference Result 68437 states and 283164 transitions. [2022-02-08 23:56:20,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-08 23:56:20,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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 95 [2022-02-08 23:56:20,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:56:20,556 INFO L225 Difference]: With dead ends: 68437 [2022-02-08 23:56:20,557 INFO L226 Difference]: Without dead ends: 48837 [2022-02-08 23:56:20,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-08 23:56:20,557 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 233 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:56:20,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 506 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:56:20,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48837 states. [2022-02-08 23:56:21,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48837 to 48837. [2022-02-08 23:56:22,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48837 states, 48836 states have (on average 4.128388893439266) internal successors, (201614), 48836 states have internal predecessors, (201614), 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) [2022-02-08 23:56:22,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48837 states to 48837 states and 201614 transitions. [2022-02-08 23:56:22,273 INFO L78 Accepts]: Start accepts. Automaton has 48837 states and 201614 transitions. Word has length 95 [2022-02-08 23:56:22,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:56:22,274 INFO L470 AbstractCegarLoop]: Abstraction has 48837 states and 201614 transitions. [2022-02-08 23:56:22,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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) [2022-02-08 23:56:22,274 INFO L276 IsEmpty]: Start isEmpty. Operand 48837 states and 201614 transitions. [2022-02-08 23:56:22,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-08 23:56:22,371 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:56:22,371 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:56:22,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-08 23:56:22,372 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-08 23:56:22,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:56:22,372 INFO L85 PathProgramCache]: Analyzing trace with hash -556298393, now seen corresponding path program 1 times [2022-02-08 23:56:22,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:56:22,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208342214] [2022-02-08 23:56:22,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:56:22,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:56:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:56:22,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:56:22,454 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:56:22,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208342214] [2022-02-08 23:56:22,454 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208342214] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:56:22,454 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:56:22,454 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-08 23:56:22,454 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531009816] [2022-02-08 23:56:22,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:56:22,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-08 23:56:22,455 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:56:22,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-08 23:56:22,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-08 23:56:22,455 INFO L87 Difference]: Start difference. First operand 48837 states and 201614 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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) [2022-02-08 23:56:23,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:56:23,170 INFO L93 Difference]: Finished difference Result 52965 states and 213984 transitions. [2022-02-08 23:56:23,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-08 23:56:23,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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 96 [2022-02-08 23:56:23,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:56:23,302 INFO L225 Difference]: With dead ends: 52965 [2022-02-08 23:56:23,303 INFO L226 Difference]: Without dead ends: 36165 [2022-02-08 23:56:23,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-02-08 23:56:23,303 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 409 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:56:23,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 585 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:56:23,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36165 states. [2022-02-08 23:56:24,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36165 to 36165. [2022-02-08 23:56:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36165 states, 36164 states have (on average 3.9961840504368986) internal successors, (144518), 36164 states have internal predecessors, (144518), 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) [2022-02-08 23:56:24,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36165 states to 36165 states and 144518 transitions. [2022-02-08 23:56:24,669 INFO L78 Accepts]: Start accepts. Automaton has 36165 states and 144518 transitions. Word has length 96 [2022-02-08 23:56:24,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:56:24,670 INFO L470 AbstractCegarLoop]: Abstraction has 36165 states and 144518 transitions. [2022-02-08 23:56:24,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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) [2022-02-08 23:56:24,670 INFO L276 IsEmpty]: Start isEmpty. Operand 36165 states and 144518 transitions. [2022-02-08 23:56:24,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-08 23:56:24,749 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:56:24,749 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:56:24,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-08 23:56:24,749 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-08 23:56:24,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:56:24,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1642918424, now seen corresponding path program 1 times [2022-02-08 23:56:24,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:56:24,750 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766932829] [2022-02-08 23:56:24,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:56:24,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:56:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:56:24,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:56:24,823 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:56:24,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766932829] [2022-02-08 23:56:24,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766932829] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:56:24,825 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:56:24,825 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-08 23:56:24,825 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970853995] [2022-02-08 23:56:24,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:56:24,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-08 23:56:24,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:56:24,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-08 23:56:24,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-08 23:56:24,826 INFO L87 Difference]: Start difference. First operand 36165 states and 144518 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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) [2022-02-08 23:56:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:56:25,605 INFO L93 Difference]: Finished difference Result 51381 states and 204651 transitions. [2022-02-08 23:56:25,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-08 23:56:25,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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 98 [2022-02-08 23:56:25,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:56:25,713 INFO L225 Difference]: With dead ends: 51381 [2022-02-08 23:56:25,713 INFO L226 Difference]: Without dead ends: 24685 [2022-02-08 23:56:25,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-08 23:56:25,714 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 129 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:56:25,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 997 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:56:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24685 states. [2022-02-08 23:56:26,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24685 to 24685. [2022-02-08 23:56:26,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24685 states, 24684 states have (on average 3.935261707988981) internal successors, (97138), 24684 states have internal predecessors, (97138), 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) [2022-02-08 23:56:26,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24685 states to 24685 states and 97138 transitions. [2022-02-08 23:56:26,575 INFO L78 Accepts]: Start accepts. Automaton has 24685 states and 97138 transitions. Word has length 98 [2022-02-08 23:56:26,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:56:26,575 INFO L470 AbstractCegarLoop]: Abstraction has 24685 states and 97138 transitions. [2022-02-08 23:56:26,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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) [2022-02-08 23:56:26,575 INFO L276 IsEmpty]: Start isEmpty. Operand 24685 states and 97138 transitions. [2022-02-08 23:56:26,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-08 23:56:26,615 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:56:26,615 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:56:26,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-08 23:56:26,615 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-08 23:56:26,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:56:26,616 INFO L85 PathProgramCache]: Analyzing trace with hash -291985236, now seen corresponding path program 2 times [2022-02-08 23:56:26,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:56:26,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308816553] [2022-02-08 23:56:26,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:56:26,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:56:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:56:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:56:26,679 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:56:26,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308816553] [2022-02-08 23:56:26,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308816553] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:56:26,679 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:56:26,679 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-08 23:56:26,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979274944] [2022-02-08 23:56:26,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:56:26,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-08 23:56:26,680 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:56:26,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-08 23:56:26,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-08 23:56:26,681 INFO L87 Difference]: Start difference. First operand 24685 states and 97138 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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) [2022-02-08 23:56:26,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:56:26,974 INFO L93 Difference]: Finished difference Result 38164 states and 148946 transitions. [2022-02-08 23:56:26,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-08 23:56:26,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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 98 [2022-02-08 23:56:26,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:56:27,069 INFO L225 Difference]: With dead ends: 38164 [2022-02-08 23:56:27,069 INFO L226 Difference]: Without dead ends: 25909 [2022-02-08 23:56:27,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-08 23:56:27,070 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 135 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:56:27,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 754 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:56:27,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25909 states. [2022-02-08 23:56:27,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25909 to 23641. [2022-02-08 23:56:27,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23641 states, 23640 states have (on average 3.861082910321489) internal successors, (91276), 23640 states have internal predecessors, (91276), 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) [2022-02-08 23:56:27,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23641 states to 23641 states and 91276 transitions. [2022-02-08 23:56:27,923 INFO L78 Accepts]: Start accepts. Automaton has 23641 states and 91276 transitions. Word has length 98 [2022-02-08 23:56:27,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:56:27,923 INFO L470 AbstractCegarLoop]: Abstraction has 23641 states and 91276 transitions. [2022-02-08 23:56:27,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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) [2022-02-08 23:56:27,923 INFO L276 IsEmpty]: Start isEmpty. Operand 23641 states and 91276 transitions. [2022-02-08 23:56:28,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-08 23:56:28,170 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:56:28,170 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:56:28,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-08 23:56:28,171 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-08 23:56:28,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:56:28,171 INFO L85 PathProgramCache]: Analyzing trace with hash 886772456, now seen corresponding path program 1 times [2022-02-08 23:56:28,171 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:56:28,171 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412873179] [2022-02-08 23:56:28,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:56:28,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:56:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:56:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:56:28,330 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:56:28,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412873179] [2022-02-08 23:56:28,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412873179] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:56:28,330 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:56:28,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-08 23:56:28,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779057881] [2022-02-08 23:56:28,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:56:28,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-08 23:56:28,331 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:56:28,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-08 23:56:28,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-08 23:56:28,332 INFO L87 Difference]: Start difference. First operand 23641 states and 91276 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 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) [2022-02-08 23:56:28,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:56:28,785 INFO L93 Difference]: Finished difference Result 21382 states and 80515 transitions. [2022-02-08 23:56:28,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-08 23:56:28,800 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 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 98 [2022-02-08 23:56:28,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:56:28,877 INFO L225 Difference]: With dead ends: 21382 [2022-02-08 23:56:28,878 INFO L226 Difference]: Without dead ends: 13594 [2022-02-08 23:56:28,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-02-08 23:56:28,878 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 442 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-08 23:56:28,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [442 Valid, 586 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-08 23:56:28,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13594 states. [2022-02-08 23:56:29,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13594 to 13594. [2022-02-08 23:56:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13594 states, 13593 states have (on average 3.714926800559111) internal successors, (50497), 13593 states have internal predecessors, (50497), 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) [2022-02-08 23:56:29,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13594 states to 13594 states and 50497 transitions. [2022-02-08 23:56:29,260 INFO L78 Accepts]: Start accepts. Automaton has 13594 states and 50497 transitions. Word has length 98 [2022-02-08 23:56:29,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:56:29,261 INFO L470 AbstractCegarLoop]: Abstraction has 13594 states and 50497 transitions. [2022-02-08 23:56:29,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 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) [2022-02-08 23:56:29,261 INFO L276 IsEmpty]: Start isEmpty. Operand 13594 states and 50497 transitions. [2022-02-08 23:56:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-08 23:56:29,411 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:56:29,411 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:56:29,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-08 23:56:29,411 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-08 23:56:29,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:56:29,412 INFO L85 PathProgramCache]: Analyzing trace with hash -853196081, now seen corresponding path program 1 times [2022-02-08 23:56:29,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:56:29,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484625623] [2022-02-08 23:56:29,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:56:29,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:56:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:56:29,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:56:29,560 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:56:29,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484625623] [2022-02-08 23:56:29,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484625623] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:56:29,560 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:56:29,561 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-08 23:56:29,561 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864103680] [2022-02-08 23:56:29,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:56:29,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-08 23:56:29,562 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:56:29,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-08 23:56:29,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-08 23:56:29,562 INFO L87 Difference]: Start difference. First operand 13594 states and 50497 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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) [2022-02-08 23:56:29,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:56:29,754 INFO L93 Difference]: Finished difference Result 10894 states and 39724 transitions. [2022-02-08 23:56:29,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-08 23:56:29,754 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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 101 [2022-02-08 23:56:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:56:29,762 INFO L225 Difference]: With dead ends: 10894 [2022-02-08 23:56:29,762 INFO L226 Difference]: Without dead ends: 2932 [2022-02-08 23:56:29,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-02-08 23:56:29,763 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 529 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:56:29,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [529 Valid, 533 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:56:29,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2022-02-08 23:56:29,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 2932. [2022-02-08 23:56:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2932 states, 2931 states have (on average 3.5417946093483454) internal successors, (10381), 2931 states have internal predecessors, (10381), 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) [2022-02-08 23:56:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2932 states to 2932 states and 10381 transitions. [2022-02-08 23:56:29,812 INFO L78 Accepts]: Start accepts. Automaton has 2932 states and 10381 transitions. Word has length 101 [2022-02-08 23:56:29,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:56:29,812 INFO L470 AbstractCegarLoop]: Abstraction has 2932 states and 10381 transitions. [2022-02-08 23:56:29,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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) [2022-02-08 23:56:29,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2932 states and 10381 transitions. [2022-02-08 23:56:29,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-08 23:56:29,817 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:56:29,817 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:56:29,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-08 23:56:29,817 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-08 23:56:29,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:56:29,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1099392193, now seen corresponding path program 1 times [2022-02-08 23:56:29,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:56:29,818 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18361098] [2022-02-08 23:56:29,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:56:29,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:56:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-08 23:56:29,851 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-08 23:56:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-08 23:56:29,935 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-08 23:56:29,936 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-08 23:56:29,936 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-02-08 23:56:29,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-02-08 23:56:29,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-02-08 23:56:29,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-02-08 23:56:29,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-02-08 23:56:29,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-02-08 23:56:29,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-02-08 23:56:29,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-08 23:56:29,942 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:56:29,945 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-08 23:56:29,946 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-08 23:56:30,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 11:56:30 BasicIcfg [2022-02-08 23:56:30,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-08 23:56:30,068 INFO L158 Benchmark]: Toolchain (without parser) took 76584.97ms. Allocated memory was 188.7MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 130.8MB in the beginning and 7.0GB in the end (delta: -6.8GB). Peak memory consumption was 970.4MB. Max. memory is 8.0GB. [2022-02-08 23:56:30,068 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-08 23:56:30,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.69ms. Allocated memory was 188.7MB in the beginning and 274.7MB in the end (delta: 86.0MB). Free memory was 130.6MB in the beginning and 234.6MB in the end (delta: -103.9MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2022-02-08 23:56:30,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.54ms. Allocated memory is still 274.7MB. Free memory was 234.6MB in the beginning and 231.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-08 23:56:30,071 INFO L158 Benchmark]: Boogie Preprocessor took 66.38ms. Allocated memory is still 274.7MB. Free memory was 231.5MB in the beginning and 229.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-08 23:56:30,071 INFO L158 Benchmark]: RCFGBuilder took 696.59ms. Allocated memory is still 274.7MB. Free memory was 229.4MB in the beginning and 156.5MB in the end (delta: 72.9MB). Peak memory consumption was 72.4MB. Max. memory is 8.0GB. [2022-02-08 23:56:30,072 INFO L158 Benchmark]: TraceAbstraction took 75364.88ms. Allocated memory was 274.7MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 156.0MB in the beginning and 7.0GB in the end (delta: -6.8GB). Peak memory consumption was 909.6MB. Max. memory is 8.0GB. [2022-02-08 23:56:30,074 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.09ms. Allocated memory is still 188.7MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 395.69ms. Allocated memory was 188.7MB in the beginning and 274.7MB in the end (delta: 86.0MB). Free memory was 130.6MB in the beginning and 234.6MB in the end (delta: -103.9MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.54ms. Allocated memory is still 274.7MB. Free memory was 234.6MB in the beginning and 231.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 66.38ms. Allocated memory is still 274.7MB. Free memory was 231.5MB in the beginning and 229.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 696.59ms. Allocated memory is still 274.7MB. Free memory was 229.4MB in the beginning and 156.5MB in the end (delta: 72.9MB). Peak memory consumption was 72.4MB. Max. memory is 8.0GB. * TraceAbstraction took 75364.88ms. Allocated memory was 274.7MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 156.0MB in the beginning and 7.0GB in the end (delta: -6.8GB). Peak memory consumption was 909.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L718] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L727] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L728] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L729] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L730] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L731] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L732] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L733] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L734] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L735] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L736] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L737] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L738] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L739] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L740] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L741] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L742] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L743] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L744] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] 0 pthread_t t1253; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1253, ((void *)0), P0, ((void *)0))=-3, t1253={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1254; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1254, ((void *)0), P1, ((void *)0))=-2, t1253={5:0}, t1254={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1255; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1255, ((void *)0), P2, ((void *)0))=-1, t1253={5:0}, t1254={6:0}, t1255={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1256; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1256, ((void *)0), P3, ((void *)0))=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L804] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L804] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=53, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 75.1s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 3.9s, AutomataDifference: 24.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5205 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5205 mSDsluCounter, 16866 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14206 mSDsCounter, 265 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2213 IncrementalHoareTripleChecker+Invalid, 2478 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 265 mSolverCounterUnsat, 3368 mSDtfsCounter, 2213 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102751occurred in iteration=0, InterpolantAutomatonStates: 206, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 39.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 46172 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1871 NumberOfCodeBlocks, 1871 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1747 ConstructedInterpolants, 0 QuantifiedInterpolants, 8484 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-08 23:56:30,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...