./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label41.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_label41.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 40a5d6cfc2906fb78e842e2acc20834b9d9ef51616470f27f80518312cafa40b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:44:28,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:44:28,094 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:28,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:44:28,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:44:28,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:44:28,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:44:28,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:44:28,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:44:28,112 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:44:28,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:44:28,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:44:28,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:44:28,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:44:28,113 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:44:28,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:44:28,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:44:28,113 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:44:28,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:44:28,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:44:28,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:44:28,113 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:44:28,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:44:28,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:44:28,114 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:44:28,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:44:28,114 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:44:28,114 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:44:28,114 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:44:28,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:44:28,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:44:28,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:44:28,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:44:28,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:44:28,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:44:28,115 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:44:28,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:44:28,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:44:28,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:44:28,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:44:28,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:44:28,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:44:28,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:44:28,115 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 -> 40a5d6cfc2906fb78e842e2acc20834b9d9ef51616470f27f80518312cafa40b [2025-02-05 10:44:28,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:44:28,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:44:28,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:44:28,332 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:44:28,332 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:44:28,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label41.c [2025-02-05 10:44:29,539 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6db3a816/666c7b1135a84d61814e96594b65d012/FLAG1c0fc583a [2025-02-05 10:44:29,913 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:44:29,914 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label41.c [2025-02-05 10:44:29,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6db3a816/666c7b1135a84d61814e96594b65d012/FLAG1c0fc583a [2025-02-05 10:44:30,134 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6db3a816/666c7b1135a84d61814e96594b65d012 [2025-02-05 10:44:30,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:44:30,139 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:44:30,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:44:30,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:44:30,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:44:30,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:44:30" (1/1) ... [2025-02-05 10:44:30,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5a079c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:30, skipping insertion in model container [2025-02-05 10:44:30,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:44:30" (1/1) ... [2025-02-05 10:44:30,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:44:30,377 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_label41.c[15650,15663] [2025-02-05 10:44:30,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:44:30,429 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:44:30,470 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_label41.c[15650,15663] [2025-02-05 10:44:30,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:44:30,491 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:44:30,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:30 WrapperNode [2025-02-05 10:44:30,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:44:30,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:44:30,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:44:30,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:44:30,497 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:30" (1/1) ... [2025-02-05 10:44:30,513 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:30" (1/1) ... [2025-02-05 10:44:30,554 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666 [2025-02-05 10:44:30,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:44:30,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:44:30,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:44:30,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:44:30,567 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:30" (1/1) ... [2025-02-05 10:44:30,568 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:30" (1/1) ... [2025-02-05 10:44:30,574 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:30" (1/1) ... [2025-02-05 10:44:30,595 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:30,595 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:30" (1/1) ... [2025-02-05 10:44:30,595 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:30" (1/1) ... [2025-02-05 10:44:30,615 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:30" (1/1) ... [2025-02-05 10:44:30,621 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:30" (1/1) ... [2025-02-05 10:44:30,626 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:30" (1/1) ... [2025-02-05 10:44:30,627 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:30" (1/1) ... [2025-02-05 10:44:30,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:44:30,634 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:44:30,634 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:44:30,634 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:44:30,634 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:30" (1/1) ... [2025-02-05 10:44:30,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:44:30,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:44:30,659 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:30,664 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:30,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:44:30,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:44:30,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:44:30,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:44:30,737 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:44:30,739 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:44:31,558 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-02-05 10:44:31,559 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:44:31,570 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:44:31,573 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:44:31,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:44:31 BoogieIcfgContainer [2025-02-05 10:44:31,573 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:44:31,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:44:31,575 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:44:31,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:44:31,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:44:30" (1/3) ... [2025-02-05 10:44:31,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5cc5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:44:31, skipping insertion in model container [2025-02-05 10:44:31,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:30" (2/3) ... [2025-02-05 10:44:31,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5cc5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:44:31, skipping insertion in model container [2025-02-05 10:44:31,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:44:31" (3/3) ... [2025-02-05 10:44:31,580 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem02_label41.c [2025-02-05 10:44:31,592 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:44:31,594 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label41.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:44:31,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:44:31,657 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;@5e916f18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:44:31,658 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:44:31,661 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:31,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 10:44:31,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:31,670 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] [2025-02-05 10:44:31,670 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:31,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:31,675 INFO L85 PathProgramCache]: Analyzing trace with hash -867967619, now seen corresponding path program 1 times [2025-02-05 10:44:31,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:31,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880749188] [2025-02-05 10:44:31,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:31,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:31,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 10:44:31,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 10:44:31,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:31,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:32,120 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:32,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:32,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880749188] [2025-02-05 10:44:32,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880749188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:32,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:32,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:44:32,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767947670] [2025-02-05 10:44:32,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:32,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:32,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:32,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:32,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:32,145 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 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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:32,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:32,673 INFO L93 Difference]: Finished difference Result 600 states and 1034 transitions. [2025-02-05 10:44:32,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:32,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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 90 [2025-02-05 10:44:32,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:32,683 INFO L225 Difference]: With dead ends: 600 [2025-02-05 10:44:32,684 INFO L226 Difference]: Without dead ends: 309 [2025-02-05 10:44:32,686 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:32,688 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 76 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 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:32,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 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:32,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-02-05 10:44:32,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2025-02-05 10:44:32,731 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:32,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 407 transitions. [2025-02-05 10:44:32,736 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 407 transitions. Word has length 90 [2025-02-05 10:44:32,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:32,736 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 407 transitions. [2025-02-05 10:44:32,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 407 transitions. [2025-02-05 10:44:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 10:44:32,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:32,738 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] [2025-02-05 10:44:32,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:44:32,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:32,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:32,739 INFO L85 PathProgramCache]: Analyzing trace with hash 413159482, now seen corresponding path program 1 times [2025-02-05 10:44:32,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:32,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366011976] [2025-02-05 10:44:32,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:32,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:32,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 10:44:32,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 10:44:32,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:32,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:32,921 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:32,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:32,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366011976] [2025-02-05 10:44:32,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366011976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:32,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:32,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:32,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156467556] [2025-02-05 10:44:32,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:32,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:32,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:32,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:32,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:32,926 INFO L87 Difference]: Start difference. First operand 307 states and 407 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:33,422 INFO L93 Difference]: Finished difference Result 758 states and 1034 transitions. [2025-02-05 10:44:33,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:33,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-05 10:44:33,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:33,424 INFO L225 Difference]: With dead ends: 758 [2025-02-05 10:44:33,424 INFO L226 Difference]: Without dead ends: 453 [2025-02-05 10:44:33,425 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:33,425 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 74 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:33,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 250 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:44:33,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-02-05 10:44:33,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2025-02-05 10:44:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.2787610619469028) internal successors, (578), 452 states have internal predecessors, (578), 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:33,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 578 transitions. [2025-02-05 10:44:33,440 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 578 transitions. Word has length 95 [2025-02-05 10:44:33,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:33,441 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 578 transitions. [2025-02-05 10:44:33,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:33,441 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 578 transitions. [2025-02-05 10:44:33,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 10:44:33,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:33,443 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:44:33,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:44:33,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:33,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:33,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1830216247, now seen corresponding path program 1 times [2025-02-05 10:44:33,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:33,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057920795] [2025-02-05 10:44:33,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:33,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:33,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 10:44:33,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 10:44:33,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:33,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:33,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:33,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057920795] [2025-02-05 10:44:33,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057920795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:33,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:33,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:44:33,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495960315] [2025-02-05 10:44:33,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:33,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:33,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:33,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:33,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:33,511 INFO L87 Difference]: Start difference. First operand 453 states and 578 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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:33,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:33,853 INFO L93 Difference]: Finished difference Result 1325 states and 1691 transitions. [2025-02-05 10:44:33,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:33,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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 107 [2025-02-05 10:44:33,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:33,856 INFO L225 Difference]: With dead ends: 1325 [2025-02-05 10:44:33,856 INFO L226 Difference]: Without dead ends: 874 [2025-02-05 10:44:33,856 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:33,857 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 185 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:33,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 80 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:44:33,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-02-05 10:44:33,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2025-02-05 10:44:33,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 1.2302405498281788) internal successors, (1074), 873 states have internal predecessors, (1074), 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:33,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1074 transitions. [2025-02-05 10:44:33,877 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1074 transitions. Word has length 107 [2025-02-05 10:44:33,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:33,878 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1074 transitions. [2025-02-05 10:44:33,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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:33,878 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1074 transitions. [2025-02-05 10:44:33,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 10:44:33,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:33,880 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:33,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:44:33,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:33,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:33,880 INFO L85 PathProgramCache]: Analyzing trace with hash -862798502, now seen corresponding path program 1 times [2025-02-05 10:44:33,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:33,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710434204] [2025-02-05 10:44:33,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:33,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:33,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 10:44:33,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 10:44:33,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:33,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:34,093 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:34,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:34,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710434204] [2025-02-05 10:44:34,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710434204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:34,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:34,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:34,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023403457] [2025-02-05 10:44:34,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:34,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:34,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:34,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:34,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:34,094 INFO L87 Difference]: Start difference. First operand 874 states and 1074 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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:34,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:34,531 INFO L93 Difference]: Finished difference Result 2027 states and 2555 transitions. [2025-02-05 10:44:34,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:34,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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 120 [2025-02-05 10:44:34,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:34,536 INFO L225 Difference]: With dead ends: 2027 [2025-02-05 10:44:34,536 INFO L226 Difference]: Without dead ends: 1155 [2025-02-05 10:44:34,536 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:34,537 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 84 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:34,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 228 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:44:34,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2025-02-05 10:44:34,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1154. [2025-02-05 10:44:34,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 1.2437120555073722) internal successors, (1434), 1153 states have internal predecessors, (1434), 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:34,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1434 transitions. [2025-02-05 10:44:34,558 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1434 transitions. Word has length 120 [2025-02-05 10:44:34,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:34,559 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1434 transitions. [2025-02-05 10:44:34,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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:34,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1434 transitions. [2025-02-05 10:44:34,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 10:44:34,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:34,561 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:34,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:44:34,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:34,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:34,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1861097137, now seen corresponding path program 1 times [2025-02-05 10:44:34,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:34,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246042569] [2025-02-05 10:44:34,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:34,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:34,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 10:44:34,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 10:44:34,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:34,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:34,655 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:34,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:34,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246042569] [2025-02-05 10:44:34,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246042569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:34,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:34,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:44:34,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837417217] [2025-02-05 10:44:34,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:34,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:34,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:34,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:34,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:34,657 INFO L87 Difference]: Start difference. First operand 1154 states and 1434 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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:34,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:34,842 INFO L93 Difference]: Finished difference Result 2295 states and 2852 transitions. [2025-02-05 10:44:34,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:34,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 123 [2025-02-05 10:44:34,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:34,846 INFO L225 Difference]: With dead ends: 2295 [2025-02-05 10:44:34,846 INFO L226 Difference]: Without dead ends: 1143 [2025-02-05 10:44:34,847 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:34,847 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 181 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:34,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 23 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:44:34,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2025-02-05 10:44:34,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1143. [2025-02-05 10:44:34,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1142 states have (on average 1.1996497373029773) internal successors, (1370), 1142 states have internal predecessors, (1370), 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:34,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1370 transitions. [2025-02-05 10:44:34,862 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1370 transitions. Word has length 123 [2025-02-05 10:44:34,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:34,862 INFO L471 AbstractCegarLoop]: Abstraction has 1143 states and 1370 transitions. [2025-02-05 10:44:34,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1370 transitions. [2025-02-05 10:44:34,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 10:44:34,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:34,864 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 10:44:34,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:44:34,864 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:34,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:34,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1501853054, now seen corresponding path program 1 times [2025-02-05 10:44:34,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:34,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41666594] [2025-02-05 10:44:34,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:34,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:34,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 10:44:34,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 10:44:34,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:34,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:34,940 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 10:44:34,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:34,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41666594] [2025-02-05 10:44:34,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41666594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:34,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:34,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:34,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561700599] [2025-02-05 10:44:34,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:34,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:34,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:34,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:34,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:34,942 INFO L87 Difference]: Start difference. First operand 1143 states and 1370 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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:35,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:35,260 INFO L93 Difference]: Finished difference Result 3128 states and 3710 transitions. [2025-02-05 10:44:35,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:35,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 129 [2025-02-05 10:44:35,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:35,276 INFO L225 Difference]: With dead ends: 3128 [2025-02-05 10:44:35,276 INFO L226 Difference]: Without dead ends: 1987 [2025-02-05 10:44:35,277 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:35,279 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 140 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:35,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 88 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:44:35,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2025-02-05 10:44:35,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1704. [2025-02-05 10:44:35,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1703 states have (on average 1.171462125660599) internal successors, (1995), 1703 states have internal predecessors, (1995), 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:35,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 1995 transitions. [2025-02-05 10:44:35,304 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 1995 transitions. Word has length 129 [2025-02-05 10:44:35,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:35,305 INFO L471 AbstractCegarLoop]: Abstraction has 1704 states and 1995 transitions. [2025-02-05 10:44:35,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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:35,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 1995 transitions. [2025-02-05 10:44:35,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 10:44:35,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:35,308 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:44:35,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:44:35,308 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:35,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:35,309 INFO L85 PathProgramCache]: Analyzing trace with hash 658479127, now seen corresponding path program 1 times [2025-02-05 10:44:35,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:35,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709073656] [2025-02-05 10:44:35,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:35,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:35,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 10:44:35,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 10:44:35,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:35,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:35,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:35,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709073656] [2025-02-05 10:44:35,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709073656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:35,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:35,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:35,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099522780] [2025-02-05 10:44:35,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:35,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:35,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:35,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:35,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:35,392 INFO L87 Difference]: Start difference. First operand 1704 states and 1995 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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:35,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:35,777 INFO L93 Difference]: Finished difference Result 4242 states and 4910 transitions. [2025-02-05 10:44:35,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:35,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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 143 [2025-02-05 10:44:35,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:35,777 INFO L225 Difference]: With dead ends: 4242 [2025-02-05 10:44:35,777 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 10:44:35,779 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:35,780 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 100 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:35,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 41 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:44:35,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 10:44:35,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 10:44:35,782 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:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 10:44:35,783 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 143 [2025-02-05 10:44:35,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:35,783 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 10:44:35,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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:35,783 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 10:44:35,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 10:44:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 10:44:35,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 10:44:35,788 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:35,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 10:44:35,903 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 10:44:35,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:44:35 BoogieIcfgContainer [2025-02-05 10:44:35,915 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 10:44:35,916 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 10:44:35,916 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 10:44:35,916 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 10:44:35,917 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:31" (3/4) ... [2025-02-05 10:44:35,918 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 10:44:35,929 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-05 10:44:35,932 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 10:44:35,933 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 10:44:35,933 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 10:44:36,010 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 10:44:36,010 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 10:44:36,010 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 10:44:36,011 INFO L158 Benchmark]: Toolchain (without parser) took 5873.13ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 131.2MB in the beginning and 112.7MB in the end (delta: 18.5MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2025-02-05 10:44:36,011 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 226.5MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:44:36,011 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.47ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 105.6MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 10:44:36,011 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.55ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 100.4MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:44:36,011 INFO L158 Benchmark]: Boogie Preprocessor took 74.27ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 96.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:44:36,012 INFO L158 Benchmark]: IcfgBuilder took 939.38ms. Allocated memory is still 167.8MB. Free memory was 96.3MB in the beginning and 100.7MB in the end (delta: -4.4MB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. [2025-02-05 10:44:36,012 INFO L158 Benchmark]: TraceAbstraction took 4341.17ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 99.9MB in the beginning and 125.2MB in the end (delta: -25.3MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2025-02-05 10:44:36,012 INFO L158 Benchmark]: Witness Printer took 94.24ms. Allocated memory is still 201.3MB. Free memory was 125.2MB in the beginning and 112.7MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:44:36,013 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.54ms. Allocated memory is still 226.5MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.47ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 105.6MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.55ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 100.4MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.27ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 96.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 939.38ms. Allocated memory is still 167.8MB. Free memory was 96.3MB in the beginning and 100.7MB in the end (delta: -4.4MB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4341.17ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 99.9MB in the beginning and 125.2MB in the end (delta: -25.3MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Witness Printer took 94.24ms. Allocated memory is still 201.3MB. Free memory was 125.2MB in the beginning and 112.7MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. 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: 452]: 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: 4.2s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 840 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 840 mSDsluCounter, 881 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 530 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2378 IncrementalHoareTripleChecker+Invalid, 2908 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 530 mSolverCounterUnsat, 785 mSDtfsCounter, 2378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1704occurred in iteration=6, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 286 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 807 NumberOfCodeBlocks, 807 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 800 ConstructedInterpolants, 0 QuantifiedInterpolants, 1742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 189/189 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: ((((((a17 <= 8) && (a25 != 1)) && (a11 != 1)) || ((a17 <= 8) && (a28 <= 7))) || (((a17 <= 8) && (a19 == 1)) && (a11 != 1))) || ((9 <= a28) && (a17 <= 8))) RESULT: Ultimate proved your program to be correct! [2025-02-05 10:44:36,025 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