./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label46.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label46.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 6c9ef72945147e4ae81caf50df56c252d6632fa10df84ba86d26e6872e2ab991 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:44:38,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:44:38,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:44:38,271 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:44:38,271 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:44:38,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:44:38,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:44:38,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:44:38,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:44:38,286 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:44:38,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:44:38,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:44:38,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:44:38,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:44:38,287 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:44:38,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:44:38,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:44:38,287 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:44:38,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:44:38,287 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:44:38,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:44:38,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:44:38,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:44:38,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:44:38,287 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:44:38,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:44:38,287 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:44:38,287 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:44:38,287 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:44:38,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:44:38,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:44:38,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:44:38,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:44:38,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:44:38,288 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:44:38,288 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:44:38,288 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:44:38,288 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:44:38,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:44:38,288 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:44:38,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:44:38,288 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:44:38,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:44:38,288 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-jdk21/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 -> 6c9ef72945147e4ae81caf50df56c252d6632fa10df84ba86d26e6872e2ab991 [2025-02-05 10:44:38,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:44:38,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:44:38,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:44:38,637 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:44:38,639 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:44:38,641 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label46.c [2025-02-05 10:44:40,007 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20185996c/cb7ed2666e9445c8994cbafb8391362b/FLAGb26c0a7aa [2025-02-05 10:44:40,360 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:44:40,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label46.c [2025-02-05 10:44:40,374 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20185996c/cb7ed2666e9445c8994cbafb8391362b/FLAGb26c0a7aa [2025-02-05 10:44:40,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20185996c/cb7ed2666e9445c8994cbafb8391362b [2025-02-05 10:44:40,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:44:40,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:44:40,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:44:40,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:44:40,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:44:40,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:44:40" (1/1) ... [2025-02-05 10:44:40,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@291a8db4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:40, skipping insertion in model container [2025-02-05 10:44:40,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:44:40" (1/1) ... [2025-02-05 10:44:40,614 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:44:40,867 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label46.c[18150,18163] [2025-02-05 10:44:40,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:44:40,894 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:44:40,960 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label46.c[18150,18163] [2025-02-05 10:44:40,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:44:40,993 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:44:40,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:40 WrapperNode [2025-02-05 10:44:40,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:44:40,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:44:40,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:44:40,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:44:41,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:40" (1/1) ... [2025-02-05 10:44:41,013 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:40" (1/1) ... [2025-02-05 10:44:41,065 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666 [2025-02-05 10:44:41,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:44:41,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:44:41,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:44:41,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:44:41,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:40" (1/1) ... [2025-02-05 10:44:41,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:40" (1/1) ... [2025-02-05 10:44:41,078 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:40" (1/1) ... [2025-02-05 10:44:41,101 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 10:44:41,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:40" (1/1) ... [2025-02-05 10:44:41,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:40" (1/1) ... [2025-02-05 10:44:41,118 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:40" (1/1) ... [2025-02-05 10:44:41,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:40" (1/1) ... [2025-02-05 10:44:41,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:40" (1/1) ... [2025-02-05 10:44:41,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:40" (1/1) ... [2025-02-05 10:44:41,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:44:41,135 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:44:41,135 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:44:41,135 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:44:41,136 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:40" (1/1) ... [2025-02-05 10:44:41,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:44:41,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:44:41,160 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 10:44:41,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 10:44:41,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:44:41,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:44:41,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:44:41,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:44:41,226 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:44:41,227 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:44:41,972 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-02-05 10:44:41,972 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:44:41,984 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:44:41,986 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:44:41,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:44:41 BoogieIcfgContainer [2025-02-05 10:44:41,986 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:44:41,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:44:41,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:44:41,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:44:41,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:44:40" (1/3) ... [2025-02-05 10:44:41,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a12478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:44:41, skipping insertion in model container [2025-02-05 10:44:41,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:40" (2/3) ... [2025-02-05 10:44:41,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a12478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:44:41, skipping insertion in model container [2025-02-05 10:44:41,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:44:41" (3/3) ... [2025-02-05 10:44:41,994 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem02_label46.c [2025-02-05 10:44:42,005 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:44:42,007 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label46.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:44:42,058 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:44:42,068 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;@34086645, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:44:42,069 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:44:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:42,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 10:44:42,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:42,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:42,082 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:42,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:42,086 INFO L85 PathProgramCache]: Analyzing trace with hash -933529892, now seen corresponding path program 1 times [2025-02-05 10:44:42,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:42,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467107830] [2025-02-05 10:44:42,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:42,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:42,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 10:44:42,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 10:44:42,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:42,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:42,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:42,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467107830] [2025-02-05 10:44:42,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467107830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:42,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:42,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:44:42,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902665334] [2025-02-05 10:44:42,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:42,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:42,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:42,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:42,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:42,593 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:43,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:43,129 INFO L93 Difference]: Finished difference Result 600 states and 1034 transitions. [2025-02-05 10:44:43,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:43,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-02-05 10:44:43,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:43,137 INFO L225 Difference]: With dead ends: 600 [2025-02-05 10:44:43,138 INFO L226 Difference]: Without dead ends: 309 [2025-02-05 10:44:43,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:43,141 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 54 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:43,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 171 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:44:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-02-05 10:44:43,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2025-02-05 10:44:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.3300653594771241) internal successors, (407), 306 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:43,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 407 transitions. [2025-02-05 10:44:43,172 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 407 transitions. Word has length 112 [2025-02-05 10:44:43,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:43,172 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 407 transitions. [2025-02-05 10:44:43,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:43,173 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 407 transitions. [2025-02-05 10:44:43,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 10:44:43,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:43,174 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:44:43,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:44:43,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:43,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:43,175 INFO L85 PathProgramCache]: Analyzing trace with hash 76844505, now seen corresponding path program 1 times [2025-02-05 10:44:43,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:43,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950016095] [2025-02-05 10:44:43,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:43,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:43,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 10:44:43,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 10:44:43,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:43,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:43,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:43,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:43,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950016095] [2025-02-05 10:44:43,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950016095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:43,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:43,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:43,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937100684] [2025-02-05 10:44:43,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:43,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:43,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:43,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:43,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:43,348 INFO L87 Difference]: Start difference. First operand 307 states and 407 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:43,800 INFO L93 Difference]: Finished difference Result 895 states and 1186 transitions. [2025-02-05 10:44:43,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:43,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2025-02-05 10:44:43,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:43,804 INFO L225 Difference]: With dead ends: 895 [2025-02-05 10:44:43,804 INFO L226 Difference]: Without dead ends: 590 [2025-02-05 10:44:43,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:43,805 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 93 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:43,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 61 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:44:43,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-02-05 10:44:43,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-02-05 10:44:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 589 states have (on average 1.2869269949066213) internal successors, (758), 589 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:43,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 758 transitions. [2025-02-05 10:44:43,822 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 758 transitions. Word has length 117 [2025-02-05 10:44:43,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:43,823 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 758 transitions. [2025-02-05 10:44:43,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:43,823 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 758 transitions. [2025-02-05 10:44:43,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 10:44:43,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:43,825 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:44:43,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:44:43,825 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:43,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:43,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1224645316, now seen corresponding path program 1 times [2025-02-05 10:44:43,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:43,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501817907] [2025-02-05 10:44:43,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:43,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:43,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 10:44:43,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 10:44:43,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:43,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:44,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:44,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501817907] [2025-02-05 10:44:44,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501817907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:44,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:44,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:44,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187206172] [2025-02-05 10:44:44,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:44,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:44,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:44,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:44,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:44,013 INFO L87 Difference]: Start difference. First operand 590 states and 758 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:44,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:44,450 INFO L93 Difference]: Finished difference Result 1460 states and 1934 transitions. [2025-02-05 10:44:44,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:44,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2025-02-05 10:44:44,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:44,454 INFO L225 Difference]: With dead ends: 1460 [2025-02-05 10:44:44,455 INFO L226 Difference]: Without dead ends: 872 [2025-02-05 10:44:44,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:44,458 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 145 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:44,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 251 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:44:44,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-02-05 10:44:44,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 871. [2025-02-05 10:44:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 1.2298850574712643) internal successors, (1070), 870 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:44,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1070 transitions. [2025-02-05 10:44:44,497 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1070 transitions. Word has length 121 [2025-02-05 10:44:44,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:44,497 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1070 transitions. [2025-02-05 10:44:44,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:44,498 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1070 transitions. [2025-02-05 10:44:44,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 10:44:44,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:44,502 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:44:44,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:44:44,503 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:44,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:44,503 INFO L85 PathProgramCache]: Analyzing trace with hash 869741042, now seen corresponding path program 1 times [2025-02-05 10:44:44,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:44,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770307681] [2025-02-05 10:44:44,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:44,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:44,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 10:44:44,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 10:44:44,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:44,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:44,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:44,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770307681] [2025-02-05 10:44:44,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770307681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:44,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:44,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:44,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094946975] [2025-02-05 10:44:44,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:44,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:44,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:44,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:44,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:44,678 INFO L87 Difference]: Start difference. First operand 871 states and 1070 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:45,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:45,094 INFO L93 Difference]: Finished difference Result 1882 states and 2342 transitions. [2025-02-05 10:44:45,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:45,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-02-05 10:44:45,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:45,098 INFO L225 Difference]: With dead ends: 1882 [2025-02-05 10:44:45,098 INFO L226 Difference]: Without dead ends: 1013 [2025-02-05 10:44:45,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:45,100 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 140 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:45,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 265 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:44:45,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-02-05 10:44:45,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1012. [2025-02-05 10:44:45,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 1.2077151335311573) internal successors, (1221), 1011 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:45,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1221 transitions. [2025-02-05 10:44:45,117 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1221 transitions. Word has length 125 [2025-02-05 10:44:45,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:45,117 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1221 transitions. [2025-02-05 10:44:45,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:45,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1221 transitions. [2025-02-05 10:44:45,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 10:44:45,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:45,119 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:44:45,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:44:45,119 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:45,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:45,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1442598411, now seen corresponding path program 1 times [2025-02-05 10:44:45,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:45,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093142331] [2025-02-05 10:44:45,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:45,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:45,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 10:44:45,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 10:44:45,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:45,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:45,200 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 10:44:45,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:45,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093142331] [2025-02-05 10:44:45,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093142331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:45,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:45,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:44:45,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005630595] [2025-02-05 10:44:45,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:45,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:45,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:45,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:45,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:45,202 INFO L87 Difference]: Start difference. First operand 1012 states and 1221 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:45,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:45,602 INFO L93 Difference]: Finished difference Result 2862 states and 3472 transitions. [2025-02-05 10:44:45,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:45,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-02-05 10:44:45,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:45,610 INFO L225 Difference]: With dead ends: 2862 [2025-02-05 10:44:45,610 INFO L226 Difference]: Without dead ends: 1852 [2025-02-05 10:44:45,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:45,613 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 180 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:45,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 81 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:44:45,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2025-02-05 10:44:45,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1852. [2025-02-05 10:44:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1851 states have (on average 1.1761210156672068) internal successors, (2177), 1851 states have internal predecessors, (2177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 2177 transitions. [2025-02-05 10:44:45,656 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 2177 transitions. Word has length 133 [2025-02-05 10:44:45,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:45,657 INFO L471 AbstractCegarLoop]: Abstraction has 1852 states and 2177 transitions. [2025-02-05 10:44:45,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:45,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2177 transitions. [2025-02-05 10:44:45,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 10:44:45,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:45,660 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:44:45,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:44:45,660 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:45,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:45,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1272987914, now seen corresponding path program 1 times [2025-02-05 10:44:45,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:45,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623502321] [2025-02-05 10:44:45,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:45,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:45,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 10:44:45,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 10:44:45,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:45,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:46,013 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:46,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:46,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623502321] [2025-02-05 10:44:46,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623502321] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:44:46,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636809826] [2025-02-05 10:44:46,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:46,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:44:46,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:44:46,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:44:46,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 10:44:46,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 10:44:46,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 10:44:46,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:46,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:46,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:44:46,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:44:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 10:44:46,289 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:44:46,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636809826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:46,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:44:46,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:44:46,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610422297] [2025-02-05 10:44:46,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:46,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:46,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:46,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:46,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:44:46,290 INFO L87 Difference]: Start difference. First operand 1852 states and 2177 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:46,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:46,715 INFO L93 Difference]: Finished difference Result 4542 states and 5429 transitions. [2025-02-05 10:44:46,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:46,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2025-02-05 10:44:46,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:46,720 INFO L225 Difference]: With dead ends: 4542 [2025-02-05 10:44:46,720 INFO L226 Difference]: Without dead ends: 1566 [2025-02-05 10:44:46,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:44:46,723 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:46,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 273 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:44:46,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2025-02-05 10:44:46,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1566. [2025-02-05 10:44:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1565 states have (on average 1.1635782747603833) internal successors, (1821), 1565 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:46,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 1821 transitions. [2025-02-05 10:44:46,747 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 1821 transitions. Word has length 139 [2025-02-05 10:44:46,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:46,747 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 1821 transitions. [2025-02-05 10:44:46,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:46,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 1821 transitions. [2025-02-05 10:44:46,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 10:44:46,750 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:46,750 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:44:46,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 10:44:46,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:44:46,954 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:46,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:46,955 INFO L85 PathProgramCache]: Analyzing trace with hash 783788636, now seen corresponding path program 1 times [2025-02-05 10:44:46,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:46,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800268398] [2025-02-05 10:44:46,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:46,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:46,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 10:44:46,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 10:44:46,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:46,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:47,194 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:44:47,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:47,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800268398] [2025-02-05 10:44:47,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800268398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:47,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:47,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:47,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514605481] [2025-02-05 10:44:47,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:47,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:44:47,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:47,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:44:47,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:44:47,197 INFO L87 Difference]: Start difference. First operand 1566 states and 1821 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:47,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:47,706 INFO L93 Difference]: Finished difference Result 3208 states and 3728 transitions. [2025-02-05 10:44:47,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:44:47,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2025-02-05 10:44:47,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:47,711 INFO L225 Difference]: With dead ends: 3208 [2025-02-05 10:44:47,711 INFO L226 Difference]: Without dead ends: 1561 [2025-02-05 10:44:47,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-02-05 10:44:47,713 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 144 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:47,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 72 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:44:47,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2025-02-05 10:44:47,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1421. [2025-02-05 10:44:47,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1420 states have (on average 1.123943661971831) internal successors, (1596), 1420 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:47,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 1596 transitions. [2025-02-05 10:44:47,732 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 1596 transitions. Word has length 146 [2025-02-05 10:44:47,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:47,732 INFO L471 AbstractCegarLoop]: Abstraction has 1421 states and 1596 transitions. [2025-02-05 10:44:47,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1596 transitions. [2025-02-05 10:44:47,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 10:44:47,734 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:47,735 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:44:47,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 10:44:47,735 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:47,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:47,735 INFO L85 PathProgramCache]: Analyzing trace with hash 755750100, now seen corresponding path program 1 times [2025-02-05 10:44:47,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:47,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557858672] [2025-02-05 10:44:47,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:47,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:47,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 10:44:47,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 10:44:47,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:47,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 10:44:47,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:47,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557858672] [2025-02-05 10:44:47,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557858672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:47,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:47,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:47,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278936497] [2025-02-05 10:44:47,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:47,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:47,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:47,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:47,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:47,803 INFO L87 Difference]: Start difference. First operand 1421 states and 1596 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:48,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:48,108 INFO L93 Difference]: Finished difference Result 2980 states and 3339 transitions. [2025-02-05 10:44:48,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:48,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2025-02-05 10:44:48,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:48,113 INFO L225 Difference]: With dead ends: 2980 [2025-02-05 10:44:48,113 INFO L226 Difference]: Without dead ends: 1561 [2025-02-05 10:44:48,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:48,115 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 146 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:48,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 35 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:44:48,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2025-02-05 10:44:48,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1561. [2025-02-05 10:44:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1560 states have (on average 1.1006410256410257) internal successors, (1717), 1560 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:48,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1717 transitions. [2025-02-05 10:44:48,135 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1717 transitions. Word has length 168 [2025-02-05 10:44:48,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:48,135 INFO L471 AbstractCegarLoop]: Abstraction has 1561 states and 1717 transitions. [2025-02-05 10:44:48,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:48,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1717 transitions. [2025-02-05 10:44:48,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-05 10:44:48,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:48,138 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 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-02-05 10:44:48,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:44:48,138 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:48,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:48,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1314724826, now seen corresponding path program 1 times [2025-02-05 10:44:48,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:48,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183566216] [2025-02-05 10:44:48,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:48,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:48,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-05 10:44:48,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-05 10:44:48,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:48,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:48,478 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 65 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:48,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:48,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183566216] [2025-02-05 10:44:48,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183566216] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:44:48,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59582878] [2025-02-05 10:44:48,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:48,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:44:48,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:44:48,480 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:44:48,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 10:44:48,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-05 10:44:48,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-05 10:44:48,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:48,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:48,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:44:48,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:44:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 10:44:48,754 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:44:48,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59582878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:48,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:44:48,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:44:48,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117626885] [2025-02-05 10:44:48,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:48,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:48,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:48,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:48,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:44:48,755 INFO L87 Difference]: Start difference. First operand 1561 states and 1717 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:49,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:49,103 INFO L93 Difference]: Finished difference Result 3540 states and 3941 transitions. [2025-02-05 10:44:49,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:49,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 186 [2025-02-05 10:44:49,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:49,110 INFO L225 Difference]: With dead ends: 3540 [2025-02-05 10:44:49,110 INFO L226 Difference]: Without dead ends: 1981 [2025-02-05 10:44:49,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:44:49,116 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 45 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:49,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 66 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:44:49,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2025-02-05 10:44:49,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1840. [2025-02-05 10:44:49,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1839 states have (on average 1.1103860793909734) internal successors, (2042), 1839 states have internal predecessors, (2042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2042 transitions. [2025-02-05 10:44:49,164 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2042 transitions. Word has length 186 [2025-02-05 10:44:49,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:49,164 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2042 transitions. [2025-02-05 10:44:49,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:49,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2042 transitions. [2025-02-05 10:44:49,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-05 10:44:49,167 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:49,168 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:44:49,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 10:44:49,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:44:49,372 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:49,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:49,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1635132729, now seen corresponding path program 1 times [2025-02-05 10:44:49,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:49,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526808874] [2025-02-05 10:44:49,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:49,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:49,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 10:44:49,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 10:44:49,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:49,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:49,447 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 10:44:49,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:49,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526808874] [2025-02-05 10:44:49,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526808874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:49,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:49,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:49,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520734332] [2025-02-05 10:44:49,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:49,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:49,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:49,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:49,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:49,448 INFO L87 Difference]: Start difference. First operand 1840 states and 2042 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:49,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:49,776 INFO L93 Difference]: Finished difference Result 3959 states and 4410 transitions. [2025-02-05 10:44:49,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:49,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2025-02-05 10:44:49,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:49,782 INFO L225 Difference]: With dead ends: 3959 [2025-02-05 10:44:49,782 INFO L226 Difference]: Without dead ends: 2121 [2025-02-05 10:44:49,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:49,785 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 135 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:49,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 188 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:44:49,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2025-02-05 10:44:49,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 2120. [2025-02-05 10:44:49,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2120 states, 2119 states have (on average 1.0906087777253421) internal successors, (2311), 2119 states have internal predecessors, (2311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:49,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 2311 transitions. [2025-02-05 10:44:49,819 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 2311 transitions. Word has length 194 [2025-02-05 10:44:49,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:49,821 INFO L471 AbstractCegarLoop]: Abstraction has 2120 states and 2311 transitions. [2025-02-05 10:44:49,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:49,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 2311 transitions. [2025-02-05 10:44:49,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-02-05 10:44:49,826 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:49,826 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:44:49,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 10:44:49,826 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:49,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:49,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1439447740, now seen corresponding path program 1 times [2025-02-05 10:44:49,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:49,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169282983] [2025-02-05 10:44:49,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:49,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:49,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-05 10:44:49,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 10:44:49,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:49,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 118 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:50,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:50,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169282983] [2025-02-05 10:44:50,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169282983] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:44:50,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881912403] [2025-02-05 10:44:50,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:50,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:44:50,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:44:50,156 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:44:50,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 10:44:50,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-05 10:44:50,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 10:44:50,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:50,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:50,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:44:50,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:44:50,410 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 10:44:50,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:44:50,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881912403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:50,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:44:50,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 10:44:50,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235978002] [2025-02-05 10:44:50,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:50,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:50,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:50,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:50,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:44:50,414 INFO L87 Difference]: Start difference. First operand 2120 states and 2311 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:50,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:50,731 INFO L93 Difference]: Finished difference Result 4659 states and 5065 transitions. [2025-02-05 10:44:50,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:50,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217 [2025-02-05 10:44:50,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:50,732 INFO L225 Difference]: With dead ends: 4659 [2025-02-05 10:44:50,732 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 10:44:50,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:44:50,738 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 52 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:50,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 223 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:44:50,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 10:44:50,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 10:44:50,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:50,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 10:44:50,740 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 217 [2025-02-05 10:44:50,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:50,740 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 10:44:50,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:50,740 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 10:44:50,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 10:44:50,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 10:44:50,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 10:44:50,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:44:50,948 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:50,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 10:44:51,117 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 10:44:51,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:44:51 BoogieIcfgContainer [2025-02-05 10:44:51,135 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 10:44:51,136 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 10:44:51,136 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 10:44:51,136 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 10:44:51,136 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:44:41" (3/4) ... [2025-02-05 10:44:51,138 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 10:44:51,157 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-05 10:44:51,158 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 10:44:51,158 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 10:44:51,159 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 10:44:51,271 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 10:44:51,272 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 10:44:51,272 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 10:44:51,273 INFO L158 Benchmark]: Toolchain (without parser) took 10683.63ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 129.3MB in the beginning and 148.4MB in the end (delta: -19.1MB). Peak memory consumption was 109.3MB. Max. memory is 16.1GB. [2025-02-05 10:44:51,273 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 218.1MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:44:51,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.42ms. Allocated memory is still 167.8MB. Free memory was 129.3MB in the beginning and 103.2MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 10:44:51,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.96ms. Allocated memory is still 167.8MB. Free memory was 103.2MB in the beginning and 98.0MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:44:51,273 INFO L158 Benchmark]: Boogie Preprocessor took 68.23ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 94.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:44:51,274 INFO L158 Benchmark]: IcfgBuilder took 851.57ms. Allocated memory is still 167.8MB. Free memory was 94.0MB in the beginning and 99.0MB in the end (delta: -5.0MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2025-02-05 10:44:51,274 INFO L158 Benchmark]: TraceAbstraction took 9146.25ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 98.2MB in the beginning and 160.4MB in the end (delta: -62.2MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB. [2025-02-05 10:44:51,274 INFO L158 Benchmark]: Witness Printer took 136.36ms. Allocated memory is still 293.6MB. Free memory was 160.4MB in the beginning and 148.4MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 10:44:51,275 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 218.1MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.42ms. Allocated memory is still 167.8MB. Free memory was 129.3MB in the beginning and 103.2MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.96ms. Allocated memory is still 167.8MB. Free memory was 103.2MB in the beginning and 98.0MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.23ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 94.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 851.57ms. Allocated memory is still 167.8MB. Free memory was 94.0MB in the beginning and 99.0MB in the end (delta: -5.0MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9146.25ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 98.2MB in the beginning and 160.4MB in the end (delta: -62.2MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB. * Witness Printer took 136.36ms. Allocated memory is still 293.6MB. Free memory was 160.4MB in the beginning and 148.4MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 518]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1168 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1168 mSDsluCounter, 1686 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 166 mSDsCounter, 799 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4140 IncrementalHoareTripleChecker+Invalid, 4939 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 799 mSolverCounterUnsat, 1520 mSDtfsCounter, 4140 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 574 GetRequests, 552 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2120occurred in iteration=10, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 286 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2200 NumberOfCodeBlocks, 2200 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2186 ConstructedInterpolants, 0 QuantifiedInterpolants, 10698 SizeOfPredicates, 0 NumberOfNonLiveVariables, 939 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 813/901 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 616]: Location Invariant Derived location invariant: (((((((a28 < 8) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || ((a25 != 1) && (a11 != 1))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a11 != 1))) || (a17 < 8)) || ((a28 <= 10) && (a11 != 1))) || (((((a17 == 8) && (a25 == 1)) && (a21 == 1)) && (a28 <= 10)) && (a19 == 1))) RESULT: Ultimate proved your program to be correct! [2025-02-05 10:44:51,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE