/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/array-patterns/array4_pattern.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 19:39:59,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 19:39:59,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-21 19:39:59,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 19:39:59,726 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 19:39:59,749 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 19:39:59,749 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 19:39:59,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 19:39:59,750 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 19:39:59,753 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 19:39:59,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 19:39:59,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 19:39:59,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 19:39:59,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 19:39:59,755 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 19:39:59,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 19:39:59,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 19:39:59,755 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 19:39:59,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 19:39:59,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 19:39:59,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 19:39:59,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 19:39:59,756 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 19:39:59,757 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 19:39:59,757 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 19:39:59,757 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 19:39:59,757 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 19:39:59,757 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 19:39:59,757 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 19:39:59,757 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 19:39:59,758 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 19:39:59,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 19:39:59,758 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 19:39:59,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 19:39:59,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 19:39:59,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 19:39:59,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 19:39:59,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 19:39:59,759 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 19:39:59,759 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 19:39:59,759 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 19:39:59,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 19:39:59,760 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 19:39:59,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 19:39:59,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 19:39:59,760 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 19:39:59,760 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-12-21 19:39:59,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 19:39:59,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 19:39:59,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 19:39:59,943 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 19:39:59,944 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 19:39:59,944 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-patterns/array4_pattern.c [2023-12-21 19:40:01,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 19:40:01,167 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 19:40:01,167 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-patterns/array4_pattern.c [2023-12-21 19:40:01,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71b1ac683/29cc97d89bbd4fa4953cbd757d590d5e/FLAGab0fa1f70 [2023-12-21 19:40:01,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71b1ac683/29cc97d89bbd4fa4953cbd757d590d5e [2023-12-21 19:40:01,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 19:40:01,187 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 19:40:01,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 19:40:01,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 19:40:01,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 19:40:01,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 07:40:01" (1/1) ... [2023-12-21 19:40:01,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ec7bc5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:40:01, skipping insertion in model container [2023-12-21 19:40:01,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 07:40:01" (1/1) ... [2023-12-21 19:40:01,206 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 19:40:01,323 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-patterns/array4_pattern.c[1835,1848] [2023-12-21 19:40:01,359 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 19:40:01,368 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 19:40:01,378 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-patterns/array4_pattern.c[1835,1848] [2023-12-21 19:40:01,404 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 19:40:01,414 INFO L206 MainTranslator]: Completed translation [2023-12-21 19:40:01,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:40:01 WrapperNode [2023-12-21 19:40:01,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 19:40:01,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 19:40:01,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 19:40:01,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 19:40:01,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:40:01" (1/1) ... [2023-12-21 19:40:01,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:40:01" (1/1) ... [2023-12-21 19:40:01,466 INFO L138 Inliner]: procedures = 18, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 92 [2023-12-21 19:40:01,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 19:40:01,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 19:40:01,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 19:40:01,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 19:40:01,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:40:01" (1/1) ... [2023-12-21 19:40:01,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:40:01" (1/1) ... [2023-12-21 19:40:01,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:40:01" (1/1) ... [2023-12-21 19:40:01,498 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 4, 4]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2023-12-21 19:40:01,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:40:01" (1/1) ... [2023-12-21 19:40:01,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:40:01" (1/1) ... [2023-12-21 19:40:01,510 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:40:01" (1/1) ... [2023-12-21 19:40:01,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:40:01" (1/1) ... [2023-12-21 19:40:01,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:40:01" (1/1) ... [2023-12-21 19:40:01,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:40:01" (1/1) ... [2023-12-21 19:40:01,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 19:40:01,526 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 19:40:01,526 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 19:40:01,526 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 19:40:01,527 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:40:01" (1/1) ... [2023-12-21 19:40:01,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 19:40:01,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 19:40:01,549 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 19:40:01,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 19:40:01,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 19:40:01,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 19:40:01,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 19:40:01,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-21 19:40:01,577 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 19:40:01,577 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 19:40:01,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 19:40:01,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-21 19:40:01,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-21 19:40:01,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-21 19:40:01,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 19:40:01,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 19:40:01,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 19:40:01,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-21 19:40:01,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-21 19:40:01,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-21 19:40:01,663 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 19:40:01,665 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 19:40:01,833 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 19:40:01,866 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 19:40:01,866 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 19:40:01,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 07:40:01 BoogieIcfgContainer [2023-12-21 19:40:01,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 19:40:01,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 19:40:01,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 19:40:01,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 19:40:01,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 07:40:01" (1/3) ... [2023-12-21 19:40:01,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b180f62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 07:40:01, skipping insertion in model container [2023-12-21 19:40:01,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:40:01" (2/3) ... [2023-12-21 19:40:01,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b180f62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 07:40:01, skipping insertion in model container [2023-12-21 19:40:01,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 07:40:01" (3/3) ... [2023-12-21 19:40:01,873 INFO L112 eAbstractionObserver]: Analyzing ICFG array4_pattern.c [2023-12-21 19:40:01,885 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 19:40:01,885 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 19:40:01,930 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 19:40:01,934 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@1557a84b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 19:40:01,935 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 19:40:01,938 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 19:40:01,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 19:40:01,947 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:40:01,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:40:01,948 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:40:01,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:40:01,951 INFO L85 PathProgramCache]: Analyzing trace with hash -661786546, now seen corresponding path program 1 times [2023-12-21 19:40:01,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:40:01,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956147944] [2023-12-21 19:40:01,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:40:01,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:40:01,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:40:01,977 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:40:01,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-21 19:40:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:40:02,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 19:40:02,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:40:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:40:02,113 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 19:40:02,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:40:02,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956147944] [2023-12-21 19:40:02,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956147944] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 19:40:02,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 19:40:02,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 19:40:02,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695129699] [2023-12-21 19:40:02,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 19:40:02,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 19:40:02,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:40:02,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 19:40:02,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 19:40:02,149 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 19:40:02,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:40:02,188 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2023-12-21 19:40:02,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 19:40:02,191 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-12-21 19:40:02,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:40:02,195 INFO L225 Difference]: With dead ends: 54 [2023-12-21 19:40:02,195 INFO L226 Difference]: Without dead ends: 26 [2023-12-21 19:40:02,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 19:40:02,204 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 19:40:02,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 19:40:02,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-21 19:40:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-21 19:40:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 19:40:02,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-12-21 19:40:02,239 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 15 [2023-12-21 19:40:02,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:40:02,239 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-12-21 19:40:02,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 19:40:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-12-21 19:40:02,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-21 19:40:02,242 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:40:02,243 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:40:02,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-21 19:40:02,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:40:02,447 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:40:02,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:40:02,448 INFO L85 PathProgramCache]: Analyzing trace with hash -41868004, now seen corresponding path program 1 times [2023-12-21 19:40:02,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:40:02,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851035657] [2023-12-21 19:40:02,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:40:02,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:40:02,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:40:02,456 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:40:02,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-21 19:40:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:40:02,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 19:40:02,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:40:02,622 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-21 19:40:02,622 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 19:40:02,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:40:02,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851035657] [2023-12-21 19:40:02,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851035657] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 19:40:02,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 19:40:02,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 19:40:02,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673622001] [2023-12-21 19:40:02,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 19:40:02,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 19:40:02,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:40:02,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 19:40:02,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 19:40:02,625 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 19:40:02,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:40:02,703 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2023-12-21 19:40:02,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 19:40:02,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2023-12-21 19:40:02,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:40:02,705 INFO L225 Difference]: With dead ends: 57 [2023-12-21 19:40:02,705 INFO L226 Difference]: Without dead ends: 36 [2023-12-21 19:40:02,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 19:40:02,706 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 19:40:02,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 19:40:02,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-21 19:40:02,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2023-12-21 19:40:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-21 19:40:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2023-12-21 19:40:02,714 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 41 [2023-12-21 19:40:02,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:40:02,716 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2023-12-21 19:40:02,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 19:40:02,716 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2023-12-21 19:40:02,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-21 19:40:02,717 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:40:02,717 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:40:02,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-21 19:40:02,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:40:02,920 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:40:02,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:40:02,920 INFO L85 PathProgramCache]: Analyzing trace with hash -851214630, now seen corresponding path program 1 times [2023-12-21 19:40:02,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:40:02,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465222227] [2023-12-21 19:40:02,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:40:02,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:40:02,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:40:02,924 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:40:02,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-21 19:40:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:40:03,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 19:40:03,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:40:03,049 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-21 19:40:03,050 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 19:40:03,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:40:03,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465222227] [2023-12-21 19:40:03,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465222227] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 19:40:03,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 19:40:03,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 19:40:03,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583026465] [2023-12-21 19:40:03,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 19:40:03,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 19:40:03,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:40:03,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 19:40:03,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 19:40:03,052 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 19:40:03,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:40:03,102 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2023-12-21 19:40:03,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 19:40:03,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2023-12-21 19:40:03,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:40:03,103 INFO L225 Difference]: With dead ends: 40 [2023-12-21 19:40:03,103 INFO L226 Difference]: Without dead ends: 36 [2023-12-21 19:40:03,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 19:40:03,104 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 19:40:03,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 19:40:03,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-21 19:40:03,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-12-21 19:40:03,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-21 19:40:03,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2023-12-21 19:40:03,111 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 41 [2023-12-21 19:40:03,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:40:03,111 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2023-12-21 19:40:03,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 19:40:03,111 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2023-12-21 19:40:03,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-21 19:40:03,122 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:40:03,122 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:40:03,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-21 19:40:03,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:40:03,323 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:40:03,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:40:03,323 INFO L85 PathProgramCache]: Analyzing trace with hash -585767715, now seen corresponding path program 1 times [2023-12-21 19:40:03,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:40:03,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817755831] [2023-12-21 19:40:03,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:40:03,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:40:03,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:40:03,327 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:40:03,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-21 19:40:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:40:03,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 19:40:03,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:40:03,572 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-21 19:40:03,572 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 19:40:03,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:40:03,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817755831] [2023-12-21 19:40:03,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817755831] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 19:40:03,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 19:40:03,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 19:40:03,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734811464] [2023-12-21 19:40:03,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 19:40:03,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 19:40:03,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:40:03,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 19:40:03,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-21 19:40:03,577 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 19:40:03,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:40:03,821 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2023-12-21 19:40:03,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 19:40:03,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2023-12-21 19:40:03,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:40:03,822 INFO L225 Difference]: With dead ends: 74 [2023-12-21 19:40:03,822 INFO L226 Difference]: Without dead ends: 42 [2023-12-21 19:40:03,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-12-21 19:40:03,823 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 27 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 19:40:03,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 65 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 19:40:03,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-21 19:40:03,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2023-12-21 19:40:03,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-21 19:40:03,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2023-12-21 19:40:03,833 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 42 [2023-12-21 19:40:03,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:40:03,833 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2023-12-21 19:40:03,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 19:40:03,833 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2023-12-21 19:40:03,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-21 19:40:03,834 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:40:03,834 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:40:03,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-21 19:40:04,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:40:04,038 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:40:04,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:40:04,039 INFO L85 PathProgramCache]: Analyzing trace with hash -329442725, now seen corresponding path program 1 times [2023-12-21 19:40:04,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:40:04,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1277931862] [2023-12-21 19:40:04,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:40:04,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:40:04,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:40:04,052 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:40:04,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-21 19:40:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:40:04,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-21 19:40:04,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:40:05,174 INFO L378 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 14 treesize of output 12 [2023-12-21 19:40:05,181 INFO L378 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 14 treesize of output 10 [2023-12-21 19:40:09,845 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:40:09,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:40:09,853 INFO L378 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 26 treesize of output 18 [2023-12-21 19:40:09,862 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:40:09,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:40:09,867 INFO L378 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 24 treesize of output 16 [2023-12-21 19:40:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-21 19:40:09,917 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:40:10,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2023-12-21 19:40:10,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2023-12-21 19:40:10,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 68 [2023-12-21 19:40:10,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 108 [2023-12-21 19:40:13,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:40:13,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1277931862] [2023-12-21 19:40:13,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1277931862] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:40:13,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1849222539] [2023-12-21 19:40:13,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:40:13,628 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-21 19:40:13,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-21 19:40:13,632 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-21 19:40:13,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-21 19:40:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:40:13,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-21 19:40:13,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:40:14,936 INFO L378 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 14 treesize of output 10 [2023-12-21 19:40:14,942 INFO L378 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 14 treesize of output 12 [2023-12-21 19:40:15,205 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:40:15,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:40:15,219 INFO L378 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 26 treesize of output 18 [2023-12-21 19:40:15,225 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:40:15,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:40:15,230 INFO L378 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 24 treesize of output 16 [2023-12-21 19:40:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-21 19:40:15,242 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:40:15,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2023-12-21 19:40:15,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2023-12-21 19:40:15,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 68 [2023-12-21 19:40:15,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 108 [2023-12-21 19:40:19,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1849222539] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:40:19,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:40:19,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 20 [2023-12-21 19:40:19,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119965351] [2023-12-21 19:40:19,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:40:19,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-21 19:40:19,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:40:19,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-21 19:40:19,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2023-12-21 19:40:19,396 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 17 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-21 19:40:35,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:40:38,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:40:38,664 INFO L93 Difference]: Finished difference Result 123 states and 160 transitions. [2023-12-21 19:40:38,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 19:40:38,665 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 17 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2023-12-21 19:40:38,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:40:38,666 INFO L225 Difference]: With dead ends: 123 [2023-12-21 19:40:38,666 INFO L226 Difference]: Without dead ends: 96 [2023-12-21 19:40:38,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 77 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=230, Invalid=1030, Unknown=0, NotChecked=0, Total=1260 [2023-12-21 19:40:38,668 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 110 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2023-12-21 19:40:38,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 222 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 15.8s Time] [2023-12-21 19:40:38,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-21 19:40:38,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2023-12-21 19:40:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 19:40:38,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2023-12-21 19:40:38,707 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 43 [2023-12-21 19:40:38,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:40:38,708 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2023-12-21 19:40:38,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 17 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-21 19:40:38,708 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2023-12-21 19:40:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-21 19:40:38,712 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:40:38,712 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:40:38,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2023-12-21 19:40:38,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-21 19:40:39,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:40:39,121 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:40:39,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:40:39,121 INFO L85 PathProgramCache]: Analyzing trace with hash -973302627, now seen corresponding path program 2 times [2023-12-21 19:40:39,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:40:39,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073984080] [2023-12-21 19:40:39,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 19:40:39,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:40:39,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:40:39,123 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:40:39,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-21 19:40:39,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 19:40:39,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:40:39,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 19:40:39,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:40:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-21 19:40:39,523 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:40:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-21 19:40:39,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:40:39,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073984080] [2023-12-21 19:40:39,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073984080] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:40:39,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:40:39,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2023-12-21 19:40:39,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856557276] [2023-12-21 19:40:39,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:40:39,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 19:40:39,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:40:39,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 19:40:39,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2023-12-21 19:40:39,744 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-21 19:40:40,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:40:40,735 INFO L93 Difference]: Finished difference Result 137 states and 181 transitions. [2023-12-21 19:40:40,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 19:40:40,736 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 44 [2023-12-21 19:40:40,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:40:40,738 INFO L225 Difference]: With dead ends: 137 [2023-12-21 19:40:40,738 INFO L226 Difference]: Without dead ends: 115 [2023-12-21 19:40:40,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2023-12-21 19:40:40,739 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 150 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-21 19:40:40,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 208 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-21 19:40:40,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-21 19:40:40,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 75. [2023-12-21 19:40:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 19:40:40,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2023-12-21 19:40:40,752 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 44 [2023-12-21 19:40:40,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:40:40,752 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2023-12-21 19:40:40,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-21 19:40:40,752 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2023-12-21 19:40:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-21 19:40:40,753 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:40:40,753 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:40:40,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-21 19:40:40,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:40:40,957 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:40:40,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:40:40,958 INFO L85 PathProgramCache]: Analyzing trace with hash -75528326, now seen corresponding path program 3 times [2023-12-21 19:40:40,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:40:40,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131311078] [2023-12-21 19:40:40,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 19:40:40,958 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:40:40,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:40:40,959 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:40:40,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-21 19:40:41,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-21 19:40:41,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:40:41,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-21 19:40:41,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:40:41,263 INFO L378 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 11 treesize of output 7 [2023-12-21 19:40:41,270 INFO L378 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 11 treesize of output 7 [2023-12-21 19:40:41,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-21 19:40:41,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-21 19:40:43,370 INFO L349 Elim1Store]: treesize reduction 194, result has 27.3 percent of original size [2023-12-21 19:40:43,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 57 treesize of output 103 [2023-12-21 19:40:43,584 INFO L349 Elim1Store]: treesize reduction 182, result has 28.6 percent of original size [2023-12-21 19:40:43,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 57 treesize of output 101 [2023-12-21 19:40:45,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:40:45,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 111 treesize of output 178 [2023-12-21 19:40:45,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:40:45,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 109 treesize of output 176 [2023-12-21 19:40:56,752 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 22 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 19:40:56,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:41:01,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:41:01,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131311078] [2023-12-21 19:41:01,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131311078] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:41:01,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1969113754] [2023-12-21 19:41:01,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 19:41:01,963 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-21 19:41:01,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-21 19:41:01,965 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-21 19:41:01,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-21 19:41:02,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-21 19:41:02,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:41:02,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-21 19:41:02,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:41:02,314 INFO L378 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 11 treesize of output 7 [2023-12-21 19:41:02,319 INFO L378 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 11 treesize of output 7 [2023-12-21 19:41:02,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-21 19:41:02,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-21 19:41:03,845 INFO L349 Elim1Store]: treesize reduction 182, result has 28.6 percent of original size [2023-12-21 19:41:03,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 57 treesize of output 101 [2023-12-21 19:41:04,025 INFO L349 Elim1Store]: treesize reduction 194, result has 27.3 percent of original size [2023-12-21 19:41:04,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 57 treesize of output 103 [2023-12-21 19:41:04,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:41:04,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 111 treesize of output 178 [2023-12-21 19:41:05,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:41:05,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 109 treesize of output 176 [2023-12-21 19:41:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 22 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 19:41:18,450 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:41:20,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1969113754] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:41:20,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:41:20,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2023-12-21 19:41:20,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975491149] [2023-12-21 19:41:20,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:41:20,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-21 19:41:20,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:41:20,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-21 19:41:20,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2023-12-21 19:41:20,466 INFO L87 Difference]: Start difference. First operand 75 states and 97 transitions. Second operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 18 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-21 19:41:24,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:41:28,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:41:33,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:41:33,081 INFO L93 Difference]: Finished difference Result 117 states and 152 transitions. [2023-12-21 19:41:33,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-21 19:41:33,082 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 18 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 45 [2023-12-21 19:41:33,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:41:33,083 INFO L225 Difference]: With dead ends: 117 [2023-12-21 19:41:33,083 INFO L226 Difference]: Without dead ends: 113 [2023-12-21 19:41:33,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 100 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=209, Invalid=981, Unknown=0, NotChecked=0, Total=1190 [2023-12-21 19:41:33,084 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 76 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 27 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2023-12-21 19:41:33,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 205 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 558 Invalid, 2 Unknown, 0 Unchecked, 11.1s Time] [2023-12-21 19:41:33,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-21 19:41:33,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 92. [2023-12-21 19:41:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 66 states have internal predecessors, (76), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-21 19:41:33,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 118 transitions. [2023-12-21 19:41:33,106 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 118 transitions. Word has length 45 [2023-12-21 19:41:33,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:41:33,106 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 118 transitions. [2023-12-21 19:41:33,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 18 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-21 19:41:33,106 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2023-12-21 19:41:33,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-21 19:41:33,107 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:41:33,107 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:41:33,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-21 19:41:33,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2023-12-21 19:41:33,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-21 19:41:33,524 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:41:33,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:41:33,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1985671229, now seen corresponding path program 4 times [2023-12-21 19:41:33,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:41:33,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127584022] [2023-12-21 19:41:33,525 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 19:41:33,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:41:33,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:41:33,526 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:41:33,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-21 19:41:33,625 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 19:41:33,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:41:33,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-21 19:41:33,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:41:34,011 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-21 19:41:34,012 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:41:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-21 19:41:34,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:41:34,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127584022] [2023-12-21 19:41:34,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127584022] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:41:34,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:41:34,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2023-12-21 19:41:34,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377334614] [2023-12-21 19:41:34,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:41:34,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-21 19:41:34,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:41:34,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-21 19:41:34,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2023-12-21 19:41:34,428 INFO L87 Difference]: Start difference. First operand 92 states and 118 transitions. Second operand has 20 states, 20 states have (on average 2.35) internal successors, (47), 19 states have internal predecessors, (47), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-21 19:41:36,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:41:36,695 INFO L93 Difference]: Finished difference Result 299 states and 402 transitions. [2023-12-21 19:41:36,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-21 19:41:36,696 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.35) internal successors, (47), 19 states have internal predecessors, (47), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 46 [2023-12-21 19:41:36,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:41:36,698 INFO L225 Difference]: With dead ends: 299 [2023-12-21 19:41:36,698 INFO L226 Difference]: Without dead ends: 261 [2023-12-21 19:41:36,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=351, Invalid=1131, Unknown=0, NotChecked=0, Total=1482 [2023-12-21 19:41:36,699 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 290 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-21 19:41:36,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 310 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-21 19:41:36,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-12-21 19:41:36,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 152. [2023-12-21 19:41:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 108 states have (on average 1.1481481481481481) internal successors, (124), 108 states have internal predecessors, (124), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-21 19:41:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 198 transitions. [2023-12-21 19:41:36,742 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 198 transitions. Word has length 46 [2023-12-21 19:41:36,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:41:36,742 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 198 transitions. [2023-12-21 19:41:36,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.35) internal successors, (47), 19 states have internal predecessors, (47), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-21 19:41:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2023-12-21 19:41:36,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-21 19:41:36,743 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:41:36,743 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:41:36,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-21 19:41:36,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:41:36,948 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:41:36,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:41:36,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2079274683, now seen corresponding path program 5 times [2023-12-21 19:41:36,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:41:36,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075958952] [2023-12-21 19:41:36,949 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 19:41:36,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:41:36,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:41:36,950 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:41:36,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-21 19:41:37,224 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2023-12-21 19:41:37,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:41:37,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-21 19:41:37,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:41:37,290 INFO L378 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 11 treesize of output 7 [2023-12-21 19:41:37,304 INFO L378 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 11 treesize of output 7 [2023-12-21 19:41:37,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-21 19:41:37,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-21 19:41:37,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:41:37,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-12-21 19:41:37,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:41:37,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-12-21 19:41:39,759 INFO L349 Elim1Store]: treesize reduction 147, result has 34.1 percent of original size [2023-12-21 19:41:39,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 57 treesize of output 104 [2023-12-21 19:41:39,909 INFO L349 Elim1Store]: treesize reduction 159, result has 32.3 percent of original size [2023-12-21 19:41:39,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 57 treesize of output 106 [2023-12-21 19:42:08,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:42:08,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 3 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 546 treesize of output 1236 [2023-12-21 19:42:09,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:42:09,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 3 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 435 treesize of output 859 [2023-12-21 19:48:56,509 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-21 19:48:56,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:48:56,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075958952] [2023-12-21 19:48:56,510 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-21 19:48:56,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-12-21 19:48:56,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-21 19:48:56,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:48:56,715 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:4000 (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.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:194) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) 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:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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) ... 82 more [2023-12-21 19:48:56,719 INFO L158 Benchmark]: Toolchain (without parser) took 535531.96ms. Allocated memory was 327.2MB in the beginning and 1.0GB in the end (delta: 700.4MB). Free memory was 285.2MB in the beginning and 883.9MB in the end (delta: -598.7MB). Peak memory consumption was 621.1MB. Max. memory is 8.0GB. [2023-12-21 19:48:56,719 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 196.1MB. Free memory was 147.9MB in the beginning and 147.7MB in the end (delta: 172.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 19:48:56,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.38ms. Allocated memory is still 327.2MB. Free memory was 285.2MB in the beginning and 273.1MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 19:48:56,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.35ms. Allocated memory is still 327.2MB. Free memory was 273.1MB in the beginning and 271.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 19:48:56,719 INFO L158 Benchmark]: Boogie Preprocessor took 58.35ms. Allocated memory is still 327.2MB. Free memory was 271.6MB in the beginning and 269.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 19:48:56,719 INFO L158 Benchmark]: RCFGBuilder took 340.72ms. Allocated memory is still 327.2MB. Free memory was 269.0MB in the beginning and 252.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-21 19:48:56,720 INFO L158 Benchmark]: TraceAbstraction took 534850.14ms. Allocated memory was 327.2MB in the beginning and 1.0GB in the end (delta: 700.4MB). Free memory was 252.2MB in the beginning and 883.9MB in the end (delta: -631.7MB). Peak memory consumption was 588.6MB. Max. memory is 8.0GB. [2023-12-21 19:48:56,720 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.13ms. Allocated memory is still 196.1MB. Free memory was 147.9MB in the beginning and 147.7MB in the end (delta: 172.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 227.38ms. Allocated memory is still 327.2MB. Free memory was 285.2MB in the beginning and 273.1MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.35ms. Allocated memory is still 327.2MB. Free memory was 273.1MB in the beginning and 271.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.35ms. Allocated memory is still 327.2MB. Free memory was 271.6MB in the beginning and 269.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 340.72ms. Allocated memory is still 327.2MB. Free memory was 269.0MB in the beginning and 252.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 534850.14ms. Allocated memory was 327.2MB in the beginning and 1.0GB in the end (delta: 700.4MB). Free memory was 252.2MB in the beginning and 883.9MB in the end (delta: -631.7MB). Peak memory consumption was 588.6MB. Max. memory is 8.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:4000 (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:4000 (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. Received shutdown request...