/usr/bin/java -Xmx7000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION --traceabstraction.number.of.independence.relations.to.use.for.por 2 --traceabstraction.abstraction.used.for.commutativity.in.por VARIABLES_GLOBAL '--traceabstraction.abstraction.used.for.commutativity.in.por.#2' NONE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-e2ee32c-m [2023-09-07 17:20:24,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-07 17:20:24,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2023-09-07 17:20:24,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-07 17:20:24,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-07 17:20:24,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-07 17:20:24,464 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-07 17:20:24,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-07 17:20:24,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-07 17:20:24,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-07 17:20:24,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-07 17:20:24,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-07 17:20:24,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-07 17:20:24,466 INFO L153 SettingsManager]: * Use SBE=true [2023-09-07 17:20:24,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-07 17:20:24,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-07 17:20:24,467 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-07 17:20:24,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-07 17:20:24,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-07 17:20:24,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-07 17:20:24,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-07 17:20:24,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-07 17:20:24,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-07 17:20:24,471 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-07 17:20:24,471 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-07 17:20:24,471 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-07 17:20:24,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-07 17:20:24,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-07 17:20:24,472 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-07 17:20:24,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-07 17:20:24,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-07 17:20:24,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-07 17:20:24,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-07 17:20:24,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-07 17:20:24,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-07 17:20:24,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-07 17:20:24,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-07 17:20:24,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-07 17:20:24,474 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-07 17:20:24,474 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2023-09-07 17:20:24,474 INFO L153 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Number of independence relations to use for POR -> 2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR -> VARIABLES_GLOBAL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR #2 -> NONE [2023-09-07 17:20:24,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-07 17:20:24,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-07 17:20:24,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-07 17:20:24,691 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-07 17:20:24,691 INFO L274 PluginConnector]: CDTParser initialized [2023-09-07 17:20:24,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-09-07 17:20:25,782 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-07 17:20:25,952 INFO L384 CDTParser]: Found 1 translation units. [2023-09-07 17:20:25,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-09-07 17:20:25,958 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f37c0a9a0/a1f1c522b4d94712a43ae9505fddb79b/FLAG03e3f66f5 [2023-09-07 17:20:25,967 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f37c0a9a0/a1f1c522b4d94712a43ae9505fddb79b [2023-09-07 17:20:25,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-07 17:20:25,970 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-07 17:20:25,971 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-07 17:20:25,971 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-07 17:20:25,974 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-07 17:20:25,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 05:20:25" (1/1) ... [2023-09-07 17:20:25,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3946e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:20:25, skipping insertion in model container [2023-09-07 17:20:25,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 05:20:25" (1/1) ... [2023-09-07 17:20:25,996 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-09-07 17:20:26,103 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[2987,3000] [2023-09-07 17:20:26,110 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-07 17:20:26,117 INFO L202 MainTranslator]: Completed pre-run [2023-09-07 17:20:26,132 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[2987,3000] [2023-09-07 17:20:26,136 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-07 17:20:26,142 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-07 17:20:26,142 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-07 17:20:26,147 INFO L206 MainTranslator]: Completed translation [2023-09-07 17:20:26,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:20:26 WrapperNode [2023-09-07 17:20:26,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-07 17:20:26,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-07 17:20:26,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-07 17:20:26,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-07 17:20:26,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:20:26" (1/1) ... [2023-09-07 17:20:26,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:20:26" (1/1) ... [2023-09-07 17:20:26,179 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 209 [2023-09-07 17:20:26,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-07 17:20:26,180 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-07 17:20:26,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-07 17:20:26,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-07 17:20:26,187 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:20:26" (1/1) ... [2023-09-07 17:20:26,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:20:26" (1/1) ... [2023-09-07 17:20:26,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:20:26" (1/1) ... [2023-09-07 17:20:26,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:20:26" (1/1) ... [2023-09-07 17:20:26,194 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:20:26" (1/1) ... [2023-09-07 17:20:26,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:20:26" (1/1) ... [2023-09-07 17:20:26,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:20:26" (1/1) ... [2023-09-07 17:20:26,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:20:26" (1/1) ... [2023-09-07 17:20:26,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-07 17:20:26,201 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-07 17:20:26,201 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-07 17:20:26,201 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-07 17:20:26,202 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:20:26" (1/1) ... [2023-09-07 17:20:26,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-07 17:20:26,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:20:26,240 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) [2023-09-07 17:20:26,242 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 [2023-09-07 17:20:26,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-07 17:20:26,265 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-07 17:20:26,265 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-07 17:20:26,265 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-07 17:20:26,265 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-07 17:20:26,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-07 17:20:26,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-07 17:20:26,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-07 17:20:26,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-07 17:20:26,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-07 17:20:26,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-07 17:20:26,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-07 17:20:26,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-07 17:20:26,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-07 17:20:26,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-07 17:20:26,267 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-07 17:20:26,345 INFO L236 CfgBuilder]: Building ICFG [2023-09-07 17:20:26,346 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-07 17:20:26,635 INFO L277 CfgBuilder]: Performing block encoding [2023-09-07 17:20:26,720 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-07 17:20:26,720 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-09-07 17:20:26,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 05:20:26 BoogieIcfgContainer [2023-09-07 17:20:26,722 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-07 17:20:26,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-07 17:20:26,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-07 17:20:26,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-07 17:20:26,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 05:20:25" (1/3) ... [2023-09-07 17:20:26,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f5ec16e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 05:20:26, skipping insertion in model container [2023-09-07 17:20:26,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:20:26" (2/3) ... [2023-09-07 17:20:26,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f5ec16e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 05:20:26, skipping insertion in model container [2023-09-07 17:20:26,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 05:20:26" (3/3) ... [2023-09-07 17:20:26,735 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2023-09-07 17:20:26,740 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-07 17:20:26,747 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-07 17:20:26,747 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-07 17:20:26,747 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-07 17:20:26,833 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-07 17:20:26,871 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 17:20:26,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-07 17:20:26,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:20:26,880 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-09-07 17:20:26,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-09-07 17:20:26,926 INFO L103 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 17:20:26,933 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2023-09-07 17:20:26,933 WARN L169 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2023-09-07 17:20:26,933 WARN L170 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2023-09-07 17:20:26,938 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-09-07 17:20:26,948 INFO L357 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=PARTIAL_ORDER_FA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@53bd89c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 17:20:26,948 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-09-07 17:20:27,242 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 17:20:27,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:20:27,246 INFO L85 PathProgramCache]: Analyzing trace with hash 460855810, now seen corresponding path program 1 times [2023-09-07 17:20:27,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:20:27,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556513221] [2023-09-07 17:20:27,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:20:27,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:20:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:20:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-07 17:20:27,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:20:27,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556513221] [2023-09-07 17:20:27,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556513221] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 17:20:27,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-07 17:20:27,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-07 17:20:27,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525729566] [2023-09-07 17:20:27,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 17:20:27,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-07 17:20:27,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:20:27,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-07 17:20:27,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-07 17:20:27,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:20:27,508 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:20:27,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 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) [2023-09-07 17:20:27,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:20:27,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:20:27,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-07 17:20:27,575 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 17:20:27,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:20:27,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1724168814, now seen corresponding path program 1 times [2023-09-07 17:20:27,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:20:27,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973036587] [2023-09-07 17:20:27,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:20:27,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:20:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:20:28,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 17:20:28,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:20:28,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973036587] [2023-09-07 17:20:28,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973036587] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 17:20:28,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-07 17:20:28,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-07 17:20:28,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849743423] [2023-09-07 17:20:28,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 17:20:28,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-07 17:20:28,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:20:28,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-07 17:20:28,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-07 17:20:28,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:20:28,016 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:20:28,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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) [2023-09-07 17:20:28,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:20:28,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:20:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:20:28,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:20:28,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-07 17:20:28,236 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 17:20:28,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:20:28,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1338531751, now seen corresponding path program 1 times [2023-09-07 17:20:28,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:20:28,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264106868] [2023-09-07 17:20:28,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:20:28,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:20:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:20:28,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-07 17:20:28,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:20:28,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264106868] [2023-09-07 17:20:28,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264106868] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 17:20:28,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-07 17:20:28,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-07 17:20:28,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288619618] [2023-09-07 17:20:28,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 17:20:28,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-07 17:20:28,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:20:28,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-07 17:20:28,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-07 17:20:28,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:20:28,471 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:20:28,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 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) [2023-09-07 17:20:28,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:20:28,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:20:28,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:20:28,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:20:28,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:20:28,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-07 17:20:28,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-07 17:20:28,599 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 17:20:28,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:20:28,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1920191497, now seen corresponding path program 1 times [2023-09-07 17:20:28,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:20:28,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465202864] [2023-09-07 17:20:28,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:20:28,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:20:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:20:31,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 17:20:31,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:20:31,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465202864] [2023-09-07 17:20:31,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465202864] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 17:20:31,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430004191] [2023-09-07 17:20:31,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:20:31,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:20:31,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:20:31,915 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 17:20:31,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-07 17:20:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:20:32,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 92 conjunts are in the unsatisfiable core [2023-09-07 17:20:32,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 17:20:32,177 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-09-07 17:20:32,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-07 17:20:32,864 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-09-07 17:20:33,229 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-09-07 17:20:34,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-07 17:20:34,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-07 17:20:34,357 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-07 17:20:34,357 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-09-07 17:20:34,744 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-09-07 17:20:35,420 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-09-07 17:20:35,588 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-09-07 17:20:36,396 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2023-09-07 17:20:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 17:20:36,668 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 17:20:48,969 INFO L322 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-09-07 17:20:48,969 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 217 treesize of output 115 [2023-09-07 17:20:49,071 INFO L322 Elim1Store]: treesize reduction 5, result has 96.6 percent of original size [2023-09-07 17:20:49,072 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 645 treesize of output 714 [2023-09-07 17:20:49,112 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-07 17:20:49,132 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 17:20:49,133 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 187 treesize of output 235 [2023-09-07 17:20:49,155 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-07 17:20:49,177 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 17:20:49,177 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 185 treesize of output 209 [2023-09-07 17:20:58,728 INFO L322 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-09-07 17:20:58,729 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 217 treesize of output 115 [2023-09-07 17:20:58,833 INFO L322 Elim1Store]: treesize reduction 4, result has 97.3 percent of original size [2023-09-07 17:20:58,833 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 317 treesize of output 419 [2023-09-07 17:20:58,891 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 17:20:58,892 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 197 treesize of output 253 [2023-09-07 17:20:58,950 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 17:20:58,950 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 231 treesize of output 263 [2023-09-07 17:21:37,722 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-07 17:21:37,724 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-07 17:21:37,727 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-09-07 17:21:37,727 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2023-09-07 17:21:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 17:21:37,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430004191] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 17:21:37,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 17:21:37,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 45, 45] total 121 [2023-09-07 17:21:37,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134997235] [2023-09-07 17:21:37,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 17:21:37,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2023-09-07 17:21:37,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:21:37,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2023-09-07 17:21:37,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1643, Invalid=12812, Unknown=65, NotChecked=0, Total=14520 [2023-09-07 17:21:37,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:21:37,819 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:21:37,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 121 states, 121 states have (on average 3.322314049586777) internal successors, (402), 121 states have internal predecessors, (402), 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) [2023-09-07 17:21:37,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:21:37,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:21:37,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-07 17:21:37,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:22:38,251 WARN L234 SmtUtils]: Spent 59.27s on a formula simplification. DAG size of input: 433 DAG size of output: 428 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 17:23:29,966 WARN L234 SmtUtils]: Spent 46.85s on a formula simplification. DAG size of input: 422 DAG size of output: 417 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 17:23:32,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:23:34,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:23:36,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:23:58,748 WARN L234 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 207 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 17:24:08,578 WARN L234 SmtUtils]: Spent 7.87s on a formula simplification that was a NOOP. DAG size: 206 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 17:24:16,803 WARN L234 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 221 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 17:24:40,587 WARN L234 SmtUtils]: Spent 10.63s on a formula simplification. DAG size of input: 337 DAG size of output: 247 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 17:24:57,609 WARN L234 SmtUtils]: Spent 11.43s on a formula simplification. DAG size of input: 345 DAG size of output: 242 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 17:25:02,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:25:04,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:25:28,136 WARN L234 SmtUtils]: Spent 6.58s on a formula simplification. DAG size of input: 264 DAG size of output: 203 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 17:25:41,544 WARN L234 SmtUtils]: Spent 9.50s on a formula simplification. DAG size of input: 262 DAG size of output: 201 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 17:26:14,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:26:25,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:26:25,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:26:25,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:26:25,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-07 17:26:25,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2023-09-07 17:26:25,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-09-07 17:26:26,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-09-07 17:26:26,145 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 17:26:26,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:26:26,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1514920154, now seen corresponding path program 2 times [2023-09-07 17:26:26,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:26:26,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765348649] [2023-09-07 17:26:26,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:26:26,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:26:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:26:26,367 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-09-07 17:26:26,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:26:26,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765348649] [2023-09-07 17:26:26,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765348649] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 17:26:26,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421040234] [2023-09-07 17:26:26,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-07 17:26:26,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:26:26,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:26:26,369 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 17:26:26,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-07 17:26:26,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-07 17:26:26,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 17:26:26,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 9 conjunts are in the unsatisfiable core [2023-09-07 17:26:26,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 17:26:26,640 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-09-07 17:26:26,640 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 17:26:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-09-07 17:26:26,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421040234] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 17:26:26,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 17:26:26,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-09-07 17:26:26,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205129428] [2023-09-07 17:26:26,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 17:26:26,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-09-07 17:26:26,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:26:26,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-09-07 17:26:26,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-09-07 17:26:26,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:26:26,849 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:26:26,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.947368421052632) internal successors, (208), 19 states have internal predecessors, (208), 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) [2023-09-07 17:26:26,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:26:26,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:26:26,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-07 17:26:26,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2023-09-07 17:26:26,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:26:27,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:26:27,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:26:27,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-07 17:26:27,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2023-09-07 17:26:27,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-07 17:26:27,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-07 17:26:27,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:26:27,477 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 17:26:27,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:26:27,477 INFO L85 PathProgramCache]: Analyzing trace with hash -107804042, now seen corresponding path program 3 times [2023-09-07 17:26:27,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:26:27,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47416318] [2023-09-07 17:26:27,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:26:27,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:26:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:26:27,648 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-09-07 17:26:27,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:26:27,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47416318] [2023-09-07 17:26:27,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47416318] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 17:26:27,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-07 17:26:27,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-07 17:26:27,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699785876] [2023-09-07 17:26:27,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 17:26:27,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-07 17:26:27,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:26:27,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-07 17:26:27,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-07 17:26:27,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:26:27,650 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:26:27,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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) [2023-09-07 17:26:27,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:26:27,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:26:27,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-07 17:26:27,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2023-09-07 17:26:27,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-09-07 17:26:27,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:26:27,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:26:27,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:26:27,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-07 17:26:27,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2023-09-07 17:26:27,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-07 17:26:27,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-07 17:26:27,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-07 17:26:27,727 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 17:26:27,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:26:27,728 INFO L85 PathProgramCache]: Analyzing trace with hash 877846404, now seen corresponding path program 4 times [2023-09-07 17:26:27,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:26:27,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949594306] [2023-09-07 17:26:27,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:26:27,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:26:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:26:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 22 proven. 32 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-09-07 17:26:28,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:26:28,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949594306] [2023-09-07 17:26:28,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949594306] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 17:26:28,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624270937] [2023-09-07 17:26:28,018 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-07 17:26:28,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:26:28,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:26:28,019 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 17:26:28,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-07 17:26:28,133 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-07 17:26:28,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 17:26:28,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 12 conjunts are in the unsatisfiable core [2023-09-07 17:26:28,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 17:26:28,536 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 43 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-09-07 17:26:28,536 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 17:26:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 25 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-09-07 17:26:28,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624270937] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 17:26:28,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 17:26:28,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2023-09-07 17:26:28,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394154181] [2023-09-07 17:26:28,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 17:26:28,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-09-07 17:26:28,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:26:28,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-09-07 17:26:28,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2023-09-07 17:26:28,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:26:28,926 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:26:28,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.321428571428571) internal successors, (289), 28 states have internal predecessors, (289), 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) [2023-09-07 17:26:28,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:26:28,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:26:28,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-07 17:26:28,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2023-09-07 17:26:28,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-09-07 17:26:28,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-07 17:26:28,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:26:29,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:26:29,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:26:29,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-07 17:26:29,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2023-09-07 17:26:29,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-07 17:26:29,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-07 17:26:29,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-09-07 17:26:29,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-07 17:26:29,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:26:29,910 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 17:26:29,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:26:29,910 INFO L85 PathProgramCache]: Analyzing trace with hash -34687335, now seen corresponding path program 5 times [2023-09-07 17:26:29,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:26:29,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436912270] [2023-09-07 17:26:29,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:26:29,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:26:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:26:30,262 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 39 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-09-07 17:26:30,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:26:30,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436912270] [2023-09-07 17:26:30,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436912270] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 17:26:30,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820961961] [2023-09-07 17:26:30,262 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-07 17:26:30,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:26:30,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:26:30,264 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 17:26:30,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-09-07 17:26:30,377 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-09-07 17:26:30,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 17:26:30,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 10 conjunts are in the unsatisfiable core [2023-09-07 17:26:30,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 17:26:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-09-07 17:26:30,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 17:26:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 25 proven. 19 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-09-07 17:26:31,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820961961] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 17:26:31,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 17:26:31,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 7] total 23 [2023-09-07 17:26:31,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163459685] [2023-09-07 17:26:31,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 17:26:31,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-09-07 17:26:31,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:26:31,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-09-07 17:26:31,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-09-07 17:26:31,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:26:31,120 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:26:31,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 17.47826086956522) internal successors, (402), 23 states have internal predecessors, (402), 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) [2023-09-07 17:26:31,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:26:31,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:26:31,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-07 17:26:31,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2023-09-07 17:26:31,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-09-07 17:26:31,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-07 17:26:31,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-09-07 17:26:31,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:26:34,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:26:34,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:26:34,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-07 17:26:34,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2023-09-07 17:26:34,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-07 17:26:34,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-07 17:26:34,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-09-07 17:26:34,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-09-07 17:26:35,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-09-07 17:26:35,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:26:35,198 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 17:26:35,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:26:35,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1999966842, now seen corresponding path program 6 times [2023-09-07 17:26:35,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:26:35,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260798526] [2023-09-07 17:26:35,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:26:35,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:26:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:26:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 17:26:41,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:26:41,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260798526] [2023-09-07 17:26:41,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260798526] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 17:26:41,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868997893] [2023-09-07 17:26:41,538 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-09-07 17:26:41,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:26:41,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:26:41,539 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 17:26:41,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-09-07 17:26:41,957 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-09-07 17:26:41,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 17:26:41,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 90 conjunts are in the unsatisfiable core [2023-09-07 17:26:41,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 17:26:43,607 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-09-07 17:26:44,137 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-09-07 17:26:44,232 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-09-07 17:26:45,759 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 17:26:45,760 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 37 [2023-09-07 17:26:46,020 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 3 proven. 72 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-07 17:26:46,021 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 17:27:03,532 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_~q1_back~0 4)) (.cse6 (* c_~q1_front~0 4))) (and (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse4 (select .cse8 c_~q2~0.base)) (.cse5 (select .cse8 ~q1~0.base))) (let ((.cse1 (select .cse5 (+ .cse7 ~q1~0.offset 4))) (.cse2 (select .cse5 (+ .cse6 ~q1~0.offset 4))) (.cse0 (select .cse4 (+ (* 4 v_~q2_front~0_45) c_~q2~0.offset))) (.cse3 (select .cse4 (+ c_~q2~0.offset (* ~q2_back~0 4))))) (or (< c_~n2~0 (+ ~q2_back~0 1)) (< v_~q2_front~0_45 1) (< .cse0 (+ .cse1 1)) (< .cse2 .cse1) (< .cse2 .cse3) (< .cse0 (+ .cse3 1)) (< ~q2_back~0 v_~q2_front~0_45)))))) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse13 (select .cse15 c_~q2~0.base)) (.cse14 (select .cse15 ~q1~0.base))) (let ((.cse9 (select .cse14 (+ .cse6 ~q1~0.offset 4))) (.cse10 (select .cse14 (+ .cse7 ~q1~0.offset 4))) (.cse12 (select .cse13 (+ (* 4 v_~q2_front~0_45) c_~q2~0.offset))) (.cse11 (select .cse13 (+ c_~q2~0.offset (* ~q2_back~0 4))))) (or (< c_~n2~0 (+ ~q2_back~0 1)) (< .cse9 (+ .cse10 1)) (< .cse9 (+ .cse11 1)) (< v_~q2_front~0_45 1) (< .cse12 .cse10) (< .cse12 .cse11) (< ~q2_back~0 v_~q2_front~0_45)))))))) is different from false [2023-09-07 17:27:03,850 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~q1_front~0 4)) (.cse5 (* c_~q1_back~0 4))) (and (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse4 (select .cse8 ~q1~0.base)) (.cse7 (select .cse8 c_~q2~0.base))) (let ((.cse0 (select .cse7 (+ (* 4 v_~q2_front~0_45) c_~q2~0.offset))) (.cse2 (select .cse7 (+ c_~q2~0.offset (* ~q2_back~0 4)))) (.cse3 (select .cse4 (+ .cse6 ~q1~0.offset 4))) (.cse1 (select .cse4 (+ .cse5 ~q1~0.offset 4)))) (or (< .cse0 (+ .cse1 1)) (< .cse0 (+ .cse2 1)) (< c_~n2~0 (+ ~q2_back~0 1)) (< .cse3 .cse2) (< v_~q2_front~0_45 1) (< .cse3 .cse1) (< ~q2_back~0 v_~q2_front~0_45)))))) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse14 (select .cse15 ~q1~0.base)) (.cse13 (select .cse15 c_~q2~0.base))) (let ((.cse9 (select .cse13 (+ (* 4 v_~q2_front~0_45) c_~q2~0.offset))) (.cse10 (select .cse14 (+ .cse5 ~q1~0.offset 4))) (.cse12 (select .cse14 (+ .cse6 ~q1~0.offset 4))) (.cse11 (select .cse13 (+ c_~q2~0.offset (* ~q2_back~0 4))))) (or (< .cse9 .cse10) (< c_~n2~0 (+ ~q2_back~0 1)) (< v_~q2_front~0_45 1) (< .cse9 .cse11) (< .cse12 (+ .cse10 1)) (< .cse12 (+ .cse11 1)) (< ~q2_back~0 v_~q2_front~0_45)))))))) is different from false [2023-09-07 17:27:04,094 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_~q1_back~0 4)) (.cse6 (* c_~q1_front~0 4))) (and (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_#t~ret17#1.base|)) (.cse5 (select .cse8 ~q1~0.base))) (let ((.cse1 (select .cse5 (+ .cse7 ~q1~0.offset 4))) (.cse0 (select .cse5 (+ .cse6 ~q1~0.offset 4))) (.cse2 (select .cse4 (+ (* 4 v_~q2_front~0_45) |c_ULTIMATE.start_main_#t~ret17#1.offset|))) (.cse3 (select .cse4 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| (* ~q2_back~0 4))))) (or (< c_~n2~0 (+ ~q2_back~0 1)) (< v_~q2_front~0_45 1) (< .cse0 (+ .cse1 1)) (< .cse2 .cse1) (< .cse0 (+ .cse3 1)) (< .cse2 .cse3) (< ~q2_back~0 v_~q2_front~0_45)))))) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse13 (select .cse15 ~q1~0.base)) (.cse14 (select .cse15 |c_ULTIMATE.start_main_#t~ret17#1.base|))) (let ((.cse10 (select .cse14 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| (* ~q2_back~0 4)))) (.cse9 (select .cse13 (+ .cse6 ~q1~0.offset 4))) (.cse11 (select .cse14 (+ (* 4 v_~q2_front~0_45) |c_ULTIMATE.start_main_#t~ret17#1.offset|))) (.cse12 (select .cse13 (+ .cse7 ~q1~0.offset 4)))) (or (< .cse9 .cse10) (< c_~n2~0 (+ ~q2_back~0 1)) (< v_~q2_front~0_45 1) (< .cse11 (+ .cse10 1)) (< .cse9 .cse12) (< .cse11 (+ .cse12 1)) (< ~q2_back~0 v_~q2_front~0_45)))))))) is different from false [2023-09-07 17:27:04,169 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~q1_back~0 4)) (.cse6 (* c_~q1_front~0 4))) (and (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse4 (select .cse8 ~q1~0.base)) (.cse7 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse0 (select .cse7 (+ (* 4 v_~q2_front~0_45) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse3 (select .cse7 (+ (* ~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse2 (select .cse4 (+ .cse6 ~q1~0.offset 4))) (.cse1 (select .cse4 (+ .cse5 ~q1~0.offset 4)))) (or (< .cse0 .cse1) (< c_~n2~0 (+ ~q2_back~0 1)) (< .cse2 (+ .cse3 1)) (< v_~q2_front~0_45 1) (< .cse0 .cse3) (< .cse2 (+ .cse1 1)) (< ~q2_back~0 v_~q2_front~0_45)))))) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse13 (select .cse15 ~q1~0.base)) (.cse14 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse10 (select .cse14 (+ (* ~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse9 (select .cse14 (+ (* 4 v_~q2_front~0_45) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse11 (select .cse13 (+ .cse6 ~q1~0.offset 4))) (.cse12 (select .cse13 (+ .cse5 ~q1~0.offset 4)))) (or (< c_~n2~0 (+ ~q2_back~0 1)) (< v_~q2_front~0_45 1) (< .cse9 (+ .cse10 1)) (< .cse11 .cse10) (< .cse9 (+ .cse12 1)) (< .cse11 .cse12) (< ~q2_back~0 v_~q2_front~0_45)))))))) is different from false [2023-09-07 17:27:04,238 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~q1_back~0 4)) (.cse7 (* c_~q1_front~0 4))) (and (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse5 (select .cse8 ~q1~0.base))) (let ((.cse2 (select .cse5 (+ .cse7 ~q1~0.offset 4))) (.cse1 (select .cse5 (+ .cse6 ~q1~0.offset 4))) (.cse0 (select .cse4 (+ (* 4 v_~q2_front~0_45) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse3 (select .cse4 (+ (* ~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse0 .cse1) (< .cse2 (+ .cse3 1)) (< c_~n2~0 (+ ~q2_back~0 1)) (< v_~q2_front~0_45 1) (< .cse2 (+ .cse1 1)) (< .cse0 .cse3) (< ~q2_back~0 v_~q2_front~0_45)))))) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse13 (select .cse15 ~q1~0.base)) (.cse14 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse9 (select .cse14 (+ (* 4 v_~q2_front~0_45) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse10 (select .cse14 (+ (* ~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse12 (select .cse13 (+ .cse7 ~q1~0.offset 4))) (.cse11 (select .cse13 (+ .cse6 ~q1~0.offset 4)))) (or (< c_~n2~0 (+ ~q2_back~0 1)) (< v_~q2_front~0_45 1) (< .cse9 (+ .cse10 1)) (< .cse9 (+ .cse11 1)) (< .cse12 .cse10) (< .cse12 .cse11) (< ~q2_back~0 v_~q2_front~0_45)))))))) is different from false [2023-09-07 17:27:05,526 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 17:27:05,526 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 145 [2023-09-07 17:27:05,611 INFO L322 Elim1Store]: treesize reduction 9, result has 90.7 percent of original size [2023-09-07 17:27:05,611 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2077 treesize of output 1842 [2023-09-07 17:27:05,662 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-07 17:27:05,690 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 17:27:05,691 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 824 treesize of output 770 [2023-09-07 17:27:05,716 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-07 17:27:05,743 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 17:27:05,743 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 752 treesize of output 568 [2023-09-07 17:27:24,926 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 17:27:24,926 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 145 [2023-09-07 17:27:24,981 INFO L322 Elim1Store]: treesize reduction 53, result has 45.4 percent of original size [2023-09-07 17:27:24,982 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3989 treesize of output 3420 [2023-09-07 17:27:25,034 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-07 17:27:25,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-07 17:27:25,057 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 17:27:25,057 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 799 treesize of output 690 [2023-09-07 17:27:25,078 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-07 17:27:25,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-07 17:27:25,098 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 17:27:25,099 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 731 treesize of output 481 [2023-09-07 17:27:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 25 refuted. 1 times theorem prover too weak. 52 trivial. 0 not checked. [2023-09-07 17:27:26,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868997893] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 17:27:26,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 17:27:26,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 43, 34] total 122 [2023-09-07 17:27:26,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693456247] [2023-09-07 17:27:26,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 17:27:26,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 122 states [2023-09-07 17:27:26,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:27:26,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2023-09-07 17:27:26,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=729, Invalid=12850, Unknown=13, NotChecked=1170, Total=14762 [2023-09-07 17:27:26,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:27:26,602 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:27:26,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 122 states, 122 states have (on average 4.065573770491803) internal successors, (496), 122 states have internal predecessors, (496), 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) [2023-09-07 17:27:26,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:27:26,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:27:26,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-07 17:27:26,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2023-09-07 17:27:26,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-09-07 17:27:26,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-07 17:27:26,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-09-07 17:27:26,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-09-07 17:27:26,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:27:39,225 WARN L234 SmtUtils]: Spent 12.17s on a formula simplification. DAG size of input: 101 DAG size of output: 59 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 17:27:45,616 WARN L234 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 102 DAG size of output: 61 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 17:27:58,037 WARN L234 SmtUtils]: Spent 12.17s on a formula simplification. DAG size of input: 103 DAG size of output: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 17:30:15,564 WARN L234 SmtUtils]: Spent 2.19m on a formula simplification. DAG size of input: 172 DAG size of output: 129 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 17:30:17,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:30:19,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:30:46,058 WARN L234 SmtUtils]: Spent 24.22s on a formula simplification. DAG size of input: 95 DAG size of output: 94 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 17:30:48,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:31:12,548 WARN L234 SmtUtils]: Spent 24.21s on a formula simplification. DAG size of input: 98 DAG size of output: 97 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 17:31:14,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:31:16,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:31:18,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:31:20,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:31:22,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:31:24,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:31:26,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:31:28,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:31:53,798 WARN L234 SmtUtils]: Spent 24.23s on a formula simplification. DAG size of input: 101 DAG size of output: 100 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 17:31:55,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:32:10,239 WARN L234 SmtUtils]: Spent 12.12s on a formula simplification that was a NOOP. DAG size: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 17:32:12,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:32:14,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:32:16,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:32:50,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-07 17:33:13,143 WARN L234 SmtUtils]: Spent 10.38s on a formula simplification. DAG size of input: 160 DAG size of output: 104 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 17:33:15,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:33:25,926 WARN L234 SmtUtils]: Spent 6.30s on a formula simplification. DAG size of input: 132 DAG size of output: 87 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 17:33:32,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 17:33:38,968 WARN L234 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 104 DAG size of output: 83 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 17:33:41,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-07 17:34:28,912 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 101 [2023-09-07 17:34:28,913 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-09-07 17:34:28,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-09-07 17:34:29,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:34:29,116 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:900) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:774) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:362) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.SleepMapReduction.computeSuccessorWithBudget(SleepMapReduction.java:186) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.SleepMapReduction.internalSuccessors(SleepMapReduction.java:156) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:235) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.OptimisticBudget.checkIsSuccessful(OptimisticBudget.java:162) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.OptimisticBudget.isSuccessful(OptimisticBudget.java:151) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.OptimisticBudget.computeBudget(OptimisticBudget.java:130) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.CachedBudget.computeBudget(CachedBudget.java:69) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.SleepMapReduction.internalSuccessors(SleepMapReduction.java:156) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.next(NestedIterator.java:94) at java.base/java.util.Iterator.forEachRemaining(Iterator.java:133) at java.base/java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1801) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEachOrdered(ReferencePipeline.java:502) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:236) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 72 more [2023-09-07 17:34:29,120 INFO L158 Benchmark]: Toolchain (without parser) took 843150.16ms. Allocated memory was 243.3MB in the beginning and 608.2MB in the end (delta: 364.9MB). Free memory was 194.0MB in the beginning and 196.9MB in the end (delta: -2.8MB). Peak memory consumption was 363.1MB. Max. memory is 7.0GB. [2023-09-07 17:34:29,120 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 160.4MB. Free memory is still 111.1MB. There was no memory consumed. Max. memory is 7.0GB. [2023-09-07 17:34:29,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.98ms. Allocated memory is still 243.3MB. Free memory was 194.0MB in the beginning and 182.2MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 7.0GB. [2023-09-07 17:34:29,120 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.34ms. Allocated memory is still 243.3MB. Free memory was 182.2MB in the beginning and 180.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-07 17:34:29,122 INFO L158 Benchmark]: Boogie Preprocessor took 20.16ms. Allocated memory is still 243.3MB. Free memory was 180.2MB in the beginning and 178.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-07 17:34:29,122 INFO L158 Benchmark]: RCFGBuilder took 521.18ms. Allocated memory is still 243.3MB. Free memory was 178.3MB in the beginning and 148.9MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 7.0GB. [2023-09-07 17:34:29,122 INFO L158 Benchmark]: TraceAbstraction took 842395.76ms. Allocated memory was 243.3MB in the beginning and 608.2MB in the end (delta: 364.9MB). Free memory was 148.3MB in the beginning and 196.9MB in the end (delta: -48.6MB). Peak memory consumption was 317.0MB. Max. memory is 7.0GB. [2023-09-07 17:34:29,124 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 160.4MB. Free memory is still 111.1MB. There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 176.98ms. Allocated memory is still 243.3MB. Free memory was 194.0MB in the beginning and 182.2MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 30.34ms. Allocated memory is still 243.3MB. Free memory was 182.2MB in the beginning and 180.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 20.16ms. Allocated memory is still 243.3MB. Free memory was 180.2MB in the beginning and 178.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * RCFGBuilder took 521.18ms. Allocated memory is still 243.3MB. Free memory was 178.3MB in the beginning and 148.9MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 7.0GB. * TraceAbstraction took 842395.76ms. Allocated memory was 243.3MB in the beginning and 608.2MB in the end (delta: 364.9MB). Free memory was 148.3MB in the beginning and 196.9MB in the end (delta: -48.6MB). Peak memory consumption was 317.0MB. Max. memory is 7.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-09-07 17:34:29,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request...