./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array22_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array22_pattern.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31d323b6985f030ac0fb5fda45d0cb8af14c3bb3898c8ff09cf5a292e40f357b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:29:06,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:29:06,609 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:29:06,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:29:06,617 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:29:06,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:29:06,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:29:06,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:29:06,630 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:29:06,630 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:29:06,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:29:06,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:29:06,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:29:06,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:29:06,631 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:29:06,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:29:06,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:29:06,631 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:29:06,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:29:06,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:29:06,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:29:06,632 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:29:06,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:29:06,632 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:29:06,632 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:29:06,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:29:06,632 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:29:06,632 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:29:06,632 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:29:06,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:29:06,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:29:06,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:29:06,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:29:06,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:29:06,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:29:06,632 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:29:06,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:29:06,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:29:06,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:29:06,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:29:06,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:29:06,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:29:06,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:29:06,633 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31d323b6985f030ac0fb5fda45d0cb8af14c3bb3898c8ff09cf5a292e40f357b [2025-03-03 09:29:06,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:29:06,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:29:06,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:29:06,852 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:29:06,852 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:29:06,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array22_pattern.c [2025-03-03 09:29:07,983 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47025f4c4/d580b68600fb49b1bb0a0ca94fff5619/FLAGb9ae10901 [2025-03-03 09:29:08,190 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:29:08,191 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array22_pattern.c [2025-03-03 09:29:08,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47025f4c4/d580b68600fb49b1bb0a0ca94fff5619/FLAGb9ae10901 [2025-03-03 09:29:08,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47025f4c4/d580b68600fb49b1bb0a0ca94fff5619 [2025-03-03 09:29:08,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:29:08,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:29:08,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:29:08,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:29:08,559 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:29:08,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:29:08" (1/1) ... [2025-03-03 09:29:08,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f46f020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:08, skipping insertion in model container [2025-03-03 09:29:08,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:29:08" (1/1) ... [2025-03-03 09:29:08,570 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:29:08,667 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array22_pattern.c[1347,1360] [2025-03-03 09:29:08,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:29:08,691 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:29:08,700 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array22_pattern.c[1347,1360] [2025-03-03 09:29:08,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:29:08,716 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:29:08,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:08 WrapperNode [2025-03-03 09:29:08,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:29:08,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:29:08,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:29:08,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:29:08,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:08" (1/1) ... [2025-03-03 09:29:08,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:08" (1/1) ... [2025-03-03 09:29:08,742 INFO L138 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2025-03-03 09:29:08,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:29:08,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:29:08,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:29:08,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:29:08,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:08" (1/1) ... [2025-03-03 09:29:08,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:08" (1/1) ... [2025-03-03 09:29:08,752 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:08" (1/1) ... [2025-03-03 09:29:08,765 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-03 09:29:08,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:08" (1/1) ... [2025-03-03 09:29:08,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:08" (1/1) ... [2025-03-03 09:29:08,773 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:08" (1/1) ... [2025-03-03 09:29:08,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:08" (1/1) ... [2025-03-03 09:29:08,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:08" (1/1) ... [2025-03-03 09:29:08,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:08" (1/1) ... [2025-03-03 09:29:08,780 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:29:08,781 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:29:08,781 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:29:08,781 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:29:08,785 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:08" (1/1) ... [2025-03-03 09:29:08,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:29:08,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:08,808 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) [2025-03-03 09:29:08,811 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 [2025-03-03 09:29:08,827 INFO L130 BoogieDeclarations]: Found specification of procedure outerBoundaryPatternCheck [2025-03-03 09:29:08,827 INFO L138 BoogieDeclarations]: Found implementation of procedure outerBoundaryPatternCheck [2025-03-03 09:29:08,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:29:08,827 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 09:29:08,828 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 09:29:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:29:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:29:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:29:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:29:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:29:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:29:08,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:29:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:29:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:29:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:29:08,878 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:29:08,880 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:29:09,009 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L52: call ULTIMATE.dealloc(main_~#array~0#1.base, main_~#array~0#1.offset);havoc main_~#array~0#1.base, main_~#array~0#1.offset; [2025-03-03 09:29:09,026 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-03 09:29:09,026 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:29:09,033 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:29:09,033 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:29:09,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:29:09 BoogieIcfgContainer [2025-03-03 09:29:09,033 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:29:09,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:29:09,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:29:09,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:29:09,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:29:08" (1/3) ... [2025-03-03 09:29:09,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d89cbe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:29:09, skipping insertion in model container [2025-03-03 09:29:09,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:08" (2/3) ... [2025-03-03 09:29:09,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d89cbe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:29:09, skipping insertion in model container [2025-03-03 09:29:09,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:29:09" (3/3) ... [2025-03-03 09:29:09,040 INFO L128 eAbstractionObserver]: Analyzing ICFG array22_pattern.c [2025-03-03 09:29:09,049 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:29:09,050 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array22_pattern.c that has 3 procedures, 36 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-03 09:29:09,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:29:09,093 INFO L333 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, 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;@699ffbb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:29:09,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:29:09,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:29:09,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 09:29:09,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:09,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:09,102 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:09,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:09,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1959484098, now seen corresponding path program 1 times [2025-03-03 09:29:09,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:09,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516557147] [2025-03-03 09:29:09,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:09,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:09,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 09:29:09,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 09:29:09,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:09,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:09,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:29:09,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:09,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516557147] [2025-03-03 09:29:09,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516557147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:29:09,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:29:09,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:29:09,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142317903] [2025-03-03 09:29:09,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:29:09,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 09:29:09,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:09,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 09:29:09,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:29:09,241 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 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.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2025-03-03 09:29:09,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:09,256 INFO L93 Difference]: Finished difference Result 69 states and 97 transitions. [2025-03-03 09:29:09,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 09:29:09,258 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 14 [2025-03-03 09:29:09,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:09,262 INFO L225 Difference]: With dead ends: 69 [2025-03-03 09:29:09,262 INFO L226 Difference]: Without dead ends: 32 [2025-03-03 09:29:09,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:29:09,268 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:09,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:29:09,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-03 09:29:09,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-03 09:29:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:29:09,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2025-03-03 09:29:09,295 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 14 [2025-03-03 09:29:09,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:09,295 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-03-03 09:29:09,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2025-03-03 09:29:09,295 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2025-03-03 09:29:09,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 09:29:09,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:09,297 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 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] [2025-03-03 09:29:09,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:29:09,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:09,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:09,298 INFO L85 PathProgramCache]: Analyzing trace with hash -634911244, now seen corresponding path program 1 times [2025-03-03 09:29:09,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:09,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780267985] [2025-03-03 09:29:09,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:09,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:09,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 09:29:09,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 09:29:09,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:09,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 09:29:09,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:09,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780267985] [2025-03-03 09:29:09,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780267985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:29:09,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:29:09,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:29:09,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797947768] [2025-03-03 09:29:09,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:29:09,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:29:09,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:09,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:29:09,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:29:09,576 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2025-03-03 09:29:09,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:09,592 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2025-03-03 09:29:09,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:29:09,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 [2025-03-03 09:29:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:09,593 INFO L225 Difference]: With dead ends: 37 [2025-03-03 09:29:09,593 INFO L226 Difference]: Without dead ends: 34 [2025-03-03 09:29:09,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:29:09,594 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:09,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 97 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:29:09,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-03 09:29:09,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-03 09:29:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:29:09,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-03-03 09:29:09,599 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 41 [2025-03-03 09:29:09,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:09,600 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-03-03 09:29:09,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2025-03-03 09:29:09,600 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-03-03 09:29:09,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:29:09,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:09,601 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 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, 1, 1, 1] [2025-03-03 09:29:09,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:29:09,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:09,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:09,602 INFO L85 PathProgramCache]: Analyzing trace with hash 484814132, now seen corresponding path program 1 times [2025-03-03 09:29:09,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:09,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445824121] [2025-03-03 09:29:09,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:09,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:09,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:29:09,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:29:09,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:09,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:09,743 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 09:29:09,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:09,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445824121] [2025-03-03 09:29:09,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445824121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:29:09,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:29:09,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:29:09,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865194403] [2025-03-03 09:29:09,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:29:09,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:29:09,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:09,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:29:09,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:29:09,746 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2025-03-03 09:29:09,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:09,820 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2025-03-03 09:29:09,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:29:09,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 44 [2025-03-03 09:29:09,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:09,821 INFO L225 Difference]: With dead ends: 68 [2025-03-03 09:29:09,821 INFO L226 Difference]: Without dead ends: 39 [2025-03-03 09:29:09,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:29:09,822 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:09,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 76 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:29:09,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-03 09:29:09,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2025-03-03 09:29:09,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:29:09,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2025-03-03 09:29:09,827 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 44 [2025-03-03 09:29:09,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:09,827 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2025-03-03 09:29:09,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2025-03-03 09:29:09,827 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2025-03-03 09:29:09,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 09:29:09,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:09,828 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 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, 1, 1, 1, 1, 1] [2025-03-03 09:29:09,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:29:09,828 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:09,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:09,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1011701486, now seen corresponding path program 1 times [2025-03-03 09:29:09,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:09,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881523289] [2025-03-03 09:29:09,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:09,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:09,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 09:29:09,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 09:29:09,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:09,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 09:29:09,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:09,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881523289] [2025-03-03 09:29:09,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881523289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:29:09,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:29:09,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:29:09,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895437674] [2025-03-03 09:29:09,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:29:09,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:29:09,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:09,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:29:09,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:29:09,914 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) [2025-03-03 09:29:09,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:09,972 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2025-03-03 09:29:09,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:29:09,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 46 [2025-03-03 09:29:09,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:09,973 INFO L225 Difference]: With dead ends: 68 [2025-03-03 09:29:09,974 INFO L226 Difference]: Without dead ends: 38 [2025-03-03 09:29:09,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:29:09,975 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:09,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 88 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:29:09,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-03 09:29:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-03-03 09:29:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:29:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2025-03-03 09:29:09,983 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 46 [2025-03-03 09:29:09,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:09,983 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2025-03-03 09:29:09,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) [2025-03-03 09:29:09,985 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2025-03-03 09:29:09,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 09:29:09,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:09,986 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:09,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:29:09,986 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:09,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:09,986 INFO L85 PathProgramCache]: Analyzing trace with hash 808191946, now seen corresponding path program 1 times [2025-03-03 09:29:09,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:09,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349352801] [2025-03-03 09:29:09,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:09,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:09,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 09:29:10,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 09:29:10,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:10,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:29:10,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:10,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349352801] [2025-03-03 09:29:10,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349352801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:10,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638936648] [2025-03-03 09:29:10,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:10,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:10,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:10,149 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:29:10,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:29:10,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 09:29:10,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 09:29:10,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:10,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:10,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:29:10,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:10,290 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:29:10,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:10,394 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:29:10,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638936648] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:10,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:29:10,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-03 09:29:10,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37295529] [2025-03-03 09:29:10,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:10,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 09:29:10,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:10,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 09:29:10,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:29:10,398 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 09:29:10,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:10,531 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2025-03-03 09:29:10,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:29:10,531 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 47 [2025-03-03 09:29:10,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:10,532 INFO L225 Difference]: With dead ends: 74 [2025-03-03 09:29:10,532 INFO L226 Difference]: Without dead ends: 44 [2025-03-03 09:29:10,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:29:10,533 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:10,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 123 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:29:10,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-03 09:29:10,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-03-03 09:29:10,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:29:10,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2025-03-03 09:29:10,537 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 47 [2025-03-03 09:29:10,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:10,538 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2025-03-03 09:29:10,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 09:29:10,538 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2025-03-03 09:29:10,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 09:29:10,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:10,540 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1] [2025-03-03 09:29:10,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 09:29:10,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:10,741 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:10,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:10,741 INFO L85 PathProgramCache]: Analyzing trace with hash 151000504, now seen corresponding path program 2 times [2025-03-03 09:29:10,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:10,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447816643] [2025-03-03 09:29:10,741 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:29:10,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:10,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-03 09:29:10,761 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 09:29:10,761 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:29:10,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:10,874 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 09:29:10,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:10,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447816643] [2025-03-03 09:29:10,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447816643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:10,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906219386] [2025-03-03 09:29:10,875 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:29:10,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:10,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:10,877 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:29:10,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:29:10,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-03 09:29:10,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 09:29:10,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:29:10,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:10,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:29:10,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:29:11,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:11,085 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 09:29:11,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906219386] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:11,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:29:11,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-03 09:29:11,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078299710] [2025-03-03 09:29:11,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:11,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 09:29:11,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:11,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 09:29:11,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:29:11,087 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 09:29:11,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:11,249 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2025-03-03 09:29:11,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:29:11,249 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 49 [2025-03-03 09:29:11,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:11,250 INFO L225 Difference]: With dead ends: 85 [2025-03-03 09:29:11,250 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 09:29:11,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:29:11,251 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:11,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 137 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:29:11,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 09:29:11,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2025-03-03 09:29:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:29:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2025-03-03 09:29:11,257 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 49 [2025-03-03 09:29:11,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:11,257 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2025-03-03 09:29:11,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 09:29:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2025-03-03 09:29:11,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:29:11,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:11,258 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2025-03-03 09:29:11,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 09:29:11,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 09:29:11,458 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:11,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:11,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2019860860, now seen corresponding path program 3 times [2025-03-03 09:29:11,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:11,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848274010] [2025-03-03 09:29:11,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:29:11,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:11,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 7 equivalence classes. [2025-03-03 09:29:11,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:11,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 09:29:11,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:29:11,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1489123295] [2025-03-03 09:29:11,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:29:11,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:11,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:11,511 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:29:11,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:29:11,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 7 equivalence classes. [2025-03-03 09:29:12,175 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:12,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 09:29:12,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:12,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-03-03 09:29:12,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:12,262 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 [2025-03-03 09:29:12,298 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 [2025-03-03 09:29:12,432 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2025-03-03 09:29:12,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2025-03-03 09:29:12,507 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2025-03-03 09:29:12,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 44 [2025-03-03 09:29:13,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:13,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:13,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:13,576 INFO L349 Elim1Store]: treesize reduction 266, result has 30.9 percent of original size [2025-03-03 09:29:13,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 88 treesize of output 158 [2025-03-03 09:29:20,324 INFO L349 Elim1Store]: treesize reduction 192, result has 34.9 percent of original size [2025-03-03 09:29:20,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 468 treesize of output 500 [2025-03-03 09:29:24,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:24,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:24,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:24,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:24,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:24,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:24,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:24,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:24,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:24,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:24,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:24,176 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:29:24,303 INFO L349 Elim1Store]: treesize reduction 370, result has 5.6 percent of original size [2025-03-03 09:29:24,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 18 case distinctions, treesize of input 693 treesize of output 890 [2025-03-03 09:29:25,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,426 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:29:25,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 65 [2025-03-03 09:29:25,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,439 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:29:25,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,492 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:29:25,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:25,869 INFO L349 Elim1Store]: treesize reduction 775, result has 7.5 percent of original size [2025-03-03 09:29:25,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 23 case distinctions, treesize of input 384 treesize of output 666 [2025-03-03 09:29:26,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:26,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:26,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:26,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:26,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:26,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:26,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:26,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:26,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:26,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:26,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:26,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:26,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:26,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:26,592 INFO L349 Elim1Store]: treesize reduction 162, result has 32.8 percent of original size [2025-03-03 09:29:26,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 204 treesize of output 196 [2025-03-03 09:29:29,442 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 261 treesize of output 213 [2025-03-03 09:29:29,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:29,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:29,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:29,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:29,503 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-03-03 09:29:29,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 1 [2025-03-03 09:29:29,512 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-03-03 09:29:29,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 1 [2025-03-03 09:29:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:29:29,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:31,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:31,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848274010] [2025-03-03 09:29:31,574 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 09:29:31,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489123295] [2025-03-03 09:29:31,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489123295] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:31,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:29:31,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2025-03-03 09:29:31,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279770341] [2025-03-03 09:29:31,575 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:31,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 09:29:31,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:31,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 09:29:31,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=2588, Unknown=1, NotChecked=0, Total=2862 [2025-03-03 09:29:31,577 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-03 09:29:36,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-03 09:29:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:38,642 INFO L93 Difference]: Finished difference Result 119 states and 149 transitions. [2025-03-03 09:29:38,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-03 09:29:38,643 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 4 states have call successors, (5), 4 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 57 [2025-03-03 09:29:38,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:38,643 INFO L225 Difference]: With dead ends: 119 [2025-03-03 09:29:38,644 INFO L226 Difference]: Without dead ends: 110 [2025-03-03 09:29:38,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1417 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=320, Invalid=3219, Unknown=1, NotChecked=0, Total=3540 [2025-03-03 09:29:38,645 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 72 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:38,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 467 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1230 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2025-03-03 09:29:38,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-03 09:29:38,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 94. [2025-03-03 09:29:38,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-03 09:29:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2025-03-03 09:29:38,663 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 57 [2025-03-03 09:29:38,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:38,663 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2025-03-03 09:29:38,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-03 09:29:38,664 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2025-03-03 09:29:38,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:29:38,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:38,665 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2025-03-03 09:29:38,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 09:29:38,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:38,865 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:38,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:38,866 INFO L85 PathProgramCache]: Analyzing trace with hash -767554627, now seen corresponding path program 1 times [2025-03-03 09:29:38,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:38,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340787827] [2025-03-03 09:29:38,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:38,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:38,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:29:38,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:38,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:38,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:38,925 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 09:29:38,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:38,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340787827] [2025-03-03 09:29:38,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340787827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:29:38,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:29:38,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:29:38,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669423848] [2025-03-03 09:29:38,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:29:38,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:29:38,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:38,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:29:38,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:29:38,927 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 09:29:38,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:38,949 INFO L93 Difference]: Finished difference Result 133 states and 163 transitions. [2025-03-03 09:29:38,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:29:38,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2025-03-03 09:29:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:38,951 INFO L225 Difference]: With dead ends: 133 [2025-03-03 09:29:38,951 INFO L226 Difference]: Without dead ends: 100 [2025-03-03 09:29:38,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:29:38,952 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:38,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:29:38,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-03 09:29:38,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2025-03-03 09:29:38,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 80 states have internal predecessors, (97), 9 states have call successors, (9), 7 states have call predecessors, (9), 9 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-03 09:29:38,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2025-03-03 09:29:38,972 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 57 [2025-03-03 09:29:38,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:38,973 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2025-03-03 09:29:38,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 09:29:38,973 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2025-03-03 09:29:38,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:29:38,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:38,974 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1] [2025-03-03 09:29:38,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 09:29:38,976 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:38,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:38,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1175388989, now seen corresponding path program 1 times [2025-03-03 09:29:38,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:38,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687798634] [2025-03-03 09:29:38,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:38,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:38,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:29:38,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:38,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:38,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:39,029 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 09:29:39,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:39,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687798634] [2025-03-03 09:29:39,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687798634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:29:39,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:29:39,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:29:39,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824437283] [2025-03-03 09:29:39,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:29:39,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:29:39,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:39,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:29:39,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:29:39,031 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 09:29:39,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:39,064 INFO L93 Difference]: Finished difference Result 137 states and 166 transitions. [2025-03-03 09:29:39,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:29:39,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2025-03-03 09:29:39,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:39,066 INFO L225 Difference]: With dead ends: 137 [2025-03-03 09:29:39,066 INFO L226 Difference]: Without dead ends: 100 [2025-03-03 09:29:39,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:29:39,066 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:39,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:29:39,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-03 09:29:39,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2025-03-03 09:29:39,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.2151898734177216) internal successors, (96), 80 states have internal predecessors, (96), 9 states have call successors, (9), 7 states have call predecessors, (9), 9 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-03 09:29:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2025-03-03 09:29:39,088 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 57 [2025-03-03 09:29:39,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:39,088 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 117 transitions. [2025-03-03 09:29:39,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 09:29:39,088 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2025-03-03 09:29:39,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:29:39,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:39,089 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1] [2025-03-03 09:29:39,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 09:29:39,089 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:39,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:39,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1612026498, now seen corresponding path program 1 times [2025-03-03 09:29:39,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:39,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924946962] [2025-03-03 09:29:39,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:39,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:39,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:29:39,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:39,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:39,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 09:29:39,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:39,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924946962] [2025-03-03 09:29:39,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924946962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:39,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637470396] [2025-03-03 09:29:39,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:39,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:39,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:39,217 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:29:39,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 09:29:39,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:29:39,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:39,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:39,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:39,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 09:29:39,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:39,397 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 09:29:39,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-03 09:29:39,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637470396] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:39,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:29:39,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 7] total 16 [2025-03-03 09:29:39,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330270442] [2025-03-03 09:29:39,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:39,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 09:29:39,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:39,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 09:29:39,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:29:39,478 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 4 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 09:29:39,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:39,757 INFO L93 Difference]: Finished difference Result 210 states and 263 transitions. [2025-03-03 09:29:39,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 09:29:39,758 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 4 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 57 [2025-03-03 09:29:39,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:39,759 INFO L225 Difference]: With dead ends: 210 [2025-03-03 09:29:39,759 INFO L226 Difference]: Without dead ends: 171 [2025-03-03 09:29:39,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-03-03 09:29:39,760 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 29 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:39,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 253 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:29:39,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-03 09:29:39,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2025-03-03 09:29:39,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.211111111111111) internal successors, (109), 90 states have internal predecessors, (109), 11 states have call successors, (11), 9 states have call predecessors, (11), 10 states have return successors, (15), 12 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-03 09:29:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2025-03-03 09:29:39,787 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 57 [2025-03-03 09:29:39,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:39,787 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2025-03-03 09:29:39,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 4 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 09:29:39,787 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2025-03-03 09:29:39,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:29:39,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:39,789 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2025-03-03 09:29:39,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 09:29:39,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:39,993 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:39,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:39,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1030341955, now seen corresponding path program 1 times [2025-03-03 09:29:39,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:39,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960938730] [2025-03-03 09:29:39,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:39,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:39,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:29:40,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:40,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:40,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 09:29:40,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:40,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960938730] [2025-03-03 09:29:40,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960938730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:40,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984407937] [2025-03-03 09:29:40,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:40,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:40,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:40,052 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:29:40,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 09:29:40,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:29:40,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:40,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:40,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:40,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:29:40,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:40,137 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 09:29:40,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:29:40,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984407937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:29:40,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:29:40,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 09:29:40,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60082937] [2025-03-03 09:29:40,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:29:40,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:29:40,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:40,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:29:40,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:29:40,139 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:29:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:40,161 INFO L93 Difference]: Finished difference Result 155 states and 188 transitions. [2025-03-03 09:29:40,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:29:40,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2025-03-03 09:29:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:40,162 INFO L225 Difference]: With dead ends: 155 [2025-03-03 09:29:40,162 INFO L226 Difference]: Without dead ends: 112 [2025-03-03 09:29:40,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:29:40,163 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:40,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:29:40,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-03 09:29:40,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-03 09:29:40,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 90 states have internal predecessors, (107), 11 states have call successors, (11), 9 states have call predecessors, (11), 10 states have return successors, (15), 12 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-03 09:29:40,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2025-03-03 09:29:40,180 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 57 [2025-03-03 09:29:40,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:40,180 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2025-03-03 09:29:40,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:29:40,181 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2025-03-03 09:29:40,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:29:40,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:40,181 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2025-03-03 09:29:40,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 09:29:40,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 09:29:40,386 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:40,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:40,387 INFO L85 PathProgramCache]: Analyzing trace with hash -650412481, now seen corresponding path program 1 times [2025-03-03 09:29:40,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:40,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269050082] [2025-03-03 09:29:40,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:40,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:40,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:29:40,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:40,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:40,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:40,424 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 09:29:40,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:40,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269050082] [2025-03-03 09:29:40,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269050082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:40,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87133389] [2025-03-03 09:29:40,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:40,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:40,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:40,427 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:29:40,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 09:29:40,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:29:40,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:40,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:40,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:40,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 09:29:40,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:40,496 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 09:29:40,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:29:40,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87133389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:29:40,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:29:40,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-03 09:29:40,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635208168] [2025-03-03 09:29:40,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:29:40,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:29:40,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:40,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:29:40,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:29:40,499 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:29:40,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:40,523 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2025-03-03 09:29:40,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:29:40,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2025-03-03 09:29:40,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:40,526 INFO L225 Difference]: With dead ends: 168 [2025-03-03 09:29:40,526 INFO L226 Difference]: Without dead ends: 106 [2025-03-03 09:29:40,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:29:40,527 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:40,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:29:40,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-03 09:29:40,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2025-03-03 09:29:40,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.1666666666666667) internal successors, (98), 84 states have internal predecessors, (98), 10 states have call successors, (10), 8 states have call predecessors, (10), 9 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-03 09:29:40,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2025-03-03 09:29:40,545 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 57 [2025-03-03 09:29:40,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:40,546 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2025-03-03 09:29:40,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:29:40,546 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2025-03-03 09:29:40,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:29:40,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:40,547 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1] [2025-03-03 09:29:40,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 09:29:40,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:40,748 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:40,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:40,748 INFO L85 PathProgramCache]: Analyzing trace with hash -68727938, now seen corresponding path program 1 times [2025-03-03 09:29:40,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:40,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174112448] [2025-03-03 09:29:40,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:40,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:40,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:29:40,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:40,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:40,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 09:29:40,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:40,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174112448] [2025-03-03 09:29:40,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174112448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:40,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490009337] [2025-03-03 09:29:40,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:40,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:40,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:40,860 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:29:40,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 09:29:40,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:29:40,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:40,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:40,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:40,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 09:29:40,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:41,027 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 09:29:41,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 09:29:41,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490009337] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:41,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:29:41,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 11] total 20 [2025-03-03 09:29:41,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335914286] [2025-03-03 09:29:41,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:41,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 09:29:41,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:41,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 09:29:41,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:29:41,157 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 6 states have call successors, (13), 4 states have call predecessors, (13), 8 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-03 09:29:41,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:41,574 INFO L93 Difference]: Finished difference Result 213 states and 254 transitions. [2025-03-03 09:29:41,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-03 09:29:41,576 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 6 states have call successors, (13), 4 states have call predecessors, (13), 8 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 57 [2025-03-03 09:29:41,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:41,577 INFO L225 Difference]: With dead ends: 213 [2025-03-03 09:29:41,577 INFO L226 Difference]: Without dead ends: 168 [2025-03-03 09:29:41,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 101 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2025-03-03 09:29:41,578 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 42 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:41,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 283 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:29:41,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-03 09:29:41,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 140. [2025-03-03 09:29:41,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 113 states have (on average 1.168141592920354) internal successors, (132), 112 states have internal predecessors, (132), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2025-03-03 09:29:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 163 transitions. [2025-03-03 09:29:41,601 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 163 transitions. Word has length 57 [2025-03-03 09:29:41,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:41,602 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 163 transitions. [2025-03-03 09:29:41,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 6 states have call successors, (13), 4 states have call predecessors, (13), 8 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-03 09:29:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 163 transitions. [2025-03-03 09:29:41,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 09:29:41,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:41,602 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2025-03-03 09:29:41,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 09:29:41,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:41,803 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:41,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:41,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1807867506, now seen corresponding path program 4 times [2025-03-03 09:29:41,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:41,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110492985] [2025-03-03 09:29:41,804 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:29:41,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:41,813 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-03-03 09:29:41,818 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 51 of 58 statements. [2025-03-03 09:29:41,818 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:29:41,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 14 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 09:29:41,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:41,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110492985] [2025-03-03 09:29:41,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110492985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:41,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092434991] [2025-03-03 09:29:41,892 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:29:41,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:41,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:41,894 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:29:41,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 09:29:41,933 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-03-03 09:29:41,946 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 51 of 58 statements. [2025-03-03 09:29:41,946 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:29:41,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:41,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:29:41,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 09:29:42,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:42,070 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 09:29:42,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092434991] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:42,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:29:42,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-03 09:29:42,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078431966] [2025-03-03 09:29:42,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:42,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:29:42,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:42,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:29:42,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:29:42,072 INFO L87 Difference]: Start difference. First operand 140 states and 163 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 09:29:42,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:42,176 INFO L93 Difference]: Finished difference Result 239 states and 277 transitions. [2025-03-03 09:29:42,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:29:42,177 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2025-03-03 09:29:42,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:42,178 INFO L225 Difference]: With dead ends: 239 [2025-03-03 09:29:42,178 INFO L226 Difference]: Without dead ends: 148 [2025-03-03 09:29:42,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 106 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:29:42,179 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:42,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 122 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:29:42,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-03 09:29:42,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 142. [2025-03-03 09:29:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 115 states have (on average 1.1478260869565218) internal successors, (132), 114 states have internal predecessors, (132), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2025-03-03 09:29:42,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 163 transitions. [2025-03-03 09:29:42,202 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 163 transitions. Word has length 58 [2025-03-03 09:29:42,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:42,202 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 163 transitions. [2025-03-03 09:29:42,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 09:29:42,203 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2025-03-03 09:29:42,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 09:29:42,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:42,203 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2025-03-03 09:29:42,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 09:29:42,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 09:29:42,408 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:42,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:42,409 INFO L85 PathProgramCache]: Analyzing trace with hash -451896072, now seen corresponding path program 5 times [2025-03-03 09:29:42,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:42,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642913904] [2025-03-03 09:29:42,409 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:29:42,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:42,416 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 8 equivalence classes. [2025-03-03 09:29:42,421 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 24 of 59 statements. [2025-03-03 09:29:42,421 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 09:29:42,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 09:29:42,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:42,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642913904] [2025-03-03 09:29:42,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642913904] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:42,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373391461] [2025-03-03 09:29:42,484 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:29:42,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:42,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:42,486 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:29:42,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 09:29:42,528 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 8 equivalence classes. [2025-03-03 09:29:42,554 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 24 of 59 statements. [2025-03-03 09:29:42,554 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 09:29:42,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:42,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:29:42,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:42,630 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 09:29:42,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 09:29:42,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373391461] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:42,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:29:42,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-03 09:29:42,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421272585] [2025-03-03 09:29:42,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:42,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:29:42,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:42,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:29:42,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:29:42,685 INFO L87 Difference]: Start difference. First operand 142 states and 163 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 09:29:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:42,876 INFO L93 Difference]: Finished difference Result 276 states and 321 transitions. [2025-03-03 09:29:42,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 09:29:42,876 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 59 [2025-03-03 09:29:42,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:42,878 INFO L225 Difference]: With dead ends: 276 [2025-03-03 09:29:42,878 INFO L226 Difference]: Without dead ends: 171 [2025-03-03 09:29:42,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 106 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2025-03-03 09:29:42,879 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 30 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:42,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 161 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:29:42,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-03 09:29:42,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 149. [2025-03-03 09:29:42,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 122 states have (on average 1.1639344262295082) internal successors, (142), 121 states have internal predecessors, (142), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2025-03-03 09:29:42,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2025-03-03 09:29:42,910 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 59 [2025-03-03 09:29:42,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:42,910 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2025-03-03 09:29:42,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 09:29:42,910 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2025-03-03 09:29:42,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 09:29:42,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:42,911 INFO L218 NwaCegarLoop]: trace histogram [8, 4, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2025-03-03 09:29:42,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 09:29:43,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 09:29:43,112 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:43,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:43,112 INFO L85 PathProgramCache]: Analyzing trace with hash 2049950938, now seen corresponding path program 6 times [2025-03-03 09:29:43,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:43,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507743225] [2025-03-03 09:29:43,112 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:29:43,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:43,119 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 63 statements into 9 equivalence classes. [2025-03-03 09:29:43,152 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 09:29:43,152 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-03 09:29:43,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 38 proven. 16 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 09:29:43,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:43,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507743225] [2025-03-03 09:29:43,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507743225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:43,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413870987] [2025-03-03 09:29:43,232 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:29:43,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:43,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:43,235 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:29:43,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 09:29:43,281 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 63 statements into 9 equivalence classes. [2025-03-03 09:29:43,505 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 09:29:43,505 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-03 09:29:43,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:43,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:29:43,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 54 proven. 15 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 09:29:43,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 37 proven. 24 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 09:29:43,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413870987] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:43,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:29:43,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-03-03 09:29:43,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745208632] [2025-03-03 09:29:43,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:43,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 09:29:43,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:43,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 09:29:43,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:29:43,625 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 09:29:43,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:43,739 INFO L93 Difference]: Finished difference Result 218 states and 245 transitions. [2025-03-03 09:29:43,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:29:43,740 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 63 [2025-03-03 09:29:43,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:43,740 INFO L225 Difference]: With dead ends: 218 [2025-03-03 09:29:43,740 INFO L226 Difference]: Without dead ends: 142 [2025-03-03 09:29:43,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 119 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:29:43,741 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 7 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:43,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 243 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:29:43,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-03 09:29:43,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2025-03-03 09:29:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 114 states have (on average 1.1228070175438596) internal successors, (128), 112 states have internal predecessors, (128), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (15), 15 states have call predecessors, (15), 14 states have call successors, (15) [2025-03-03 09:29:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2025-03-03 09:29:43,761 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 157 transitions. Word has length 63 [2025-03-03 09:29:43,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:43,761 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 157 transitions. [2025-03-03 09:29:43,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 09:29:43,761 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 157 transitions. [2025-03-03 09:29:43,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 09:29:43,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:43,762 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2025-03-03 09:29:43,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 09:29:43,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 09:29:43,963 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:43,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:43,963 INFO L85 PathProgramCache]: Analyzing trace with hash -787902902, now seen corresponding path program 7 times [2025-03-03 09:29:43,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:43,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502889667] [2025-03-03 09:29:43,963 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:29:43,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:43,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 09:29:43,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 09:29:43,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:43,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:29:43,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [946205854] [2025-03-03 09:29:44,001 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:29:44,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:44,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:44,003 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:29:44,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 09:29:44,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 09:29:44,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 09:29:44,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:44,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:44,853 WARN L254 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 169 conjuncts are in the unsatisfiable core [2025-03-03 09:29:44,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:44,898 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 [2025-03-03 09:29:44,923 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 [2025-03-03 09:29:44,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:29:44,950 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 [2025-03-03 09:29:45,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:29:45,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-03 09:29:45,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:29:45,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2025-03-03 09:29:45,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:29:45,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 58 [2025-03-03 09:29:45,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:29:45,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 68 [2025-03-03 09:29:45,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:29:45,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 61 treesize of output 78 [2025-03-03 09:29:45,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:29:45,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 68 treesize of output 88 [2025-03-03 09:29:46,560 INFO L349 Elim1Store]: treesize reduction 468, result has 33.4 percent of original size [2025-03-03 09:29:46,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 36 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 171 case distinctions, treesize of input 144 treesize of output 302 [2025-03-03 09:29:54,888 INFO L349 Elim1Store]: treesize reduction 480, result has 26.3 percent of original size [2025-03-03 09:29:54,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 65 case distinctions, treesize of input 859 treesize of output 815 [2025-03-03 09:30:01,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 610 [2025-03-03 09:30:02,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,283 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,297 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 8 select indices, 8 select index equivalence classes, 45 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 518 [2025-03-03 09:30:02,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,745 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,746 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,746 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,747 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,747 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,748 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,748 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,752 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,752 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,752 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,753 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,753 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,753 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 31 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 97 [2025-03-03 09:30:02,798 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,799 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,800 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,801 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,801 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,802 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,802 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,802 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,803 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,803 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,803 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,804 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,804 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 31 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 97 [2025-03-03 09:30:02,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,865 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,866 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,867 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,868 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,869 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,869 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,870 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,871 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,871 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,872 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,874 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,874 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,875 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,879 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,880 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,880 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,881 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,882 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,883 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 8 select indices, 8 select index equivalence classes, 32 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 206 [2025-03-03 09:30:02,952 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,953 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,953 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,953 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:02,955 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,955 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,955 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,955 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,956 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,956 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,956 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,956 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,957 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:02,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 31 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 97 [2025-03-03 09:30:03,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 85 [2025-03-03 09:30:03,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 131 [2025-03-03 09:30:07,497 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 454 treesize of output 338 [2025-03-03 09:30:07,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 9 select indices, 9 select index equivalence classes, 39 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 338 treesize of output 541 [2025-03-03 09:30:08,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 69 [2025-03-03 09:30:08,170 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 8 proven. 151 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:30:08,170 INFO L312 TraceCheckSpWp]: Computing backward predicates...