./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label06.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8fe6fb83fb08ef54afbd8d78d8c97f9d20e73a7ae4eae7f287d2ff90296f8470 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:58:20,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:58:20,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:58:20,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:58:20,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:58:20,960 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:58:20,961 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:58:20,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:58:20,961 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:58:20,961 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:58:20,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:58:20,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:58:20,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:58:20,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:58:20,961 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:58:20,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:58:20,962 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:58:20,962 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:58:20,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:58:20,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:58:20,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:58:20,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:58:20,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:58:20,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:58:20,964 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:58:20,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:58:20,964 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:58:20,964 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:58:20,964 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:58:20,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:58:20,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:58:20,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:58:20,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:58:20,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:58:20,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:58:20,965 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:58:20,965 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:58:20,965 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:58:20,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:58:20,965 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:58:20,965 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:58:20,966 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:58:20,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:58:20,966 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8fe6fb83fb08ef54afbd8d78d8c97f9d20e73a7ae4eae7f287d2ff90296f8470 [2025-03-08 00:58:21,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:58:21,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:58:21,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:58:21,194 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:58:21,194 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:58:21,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label06.c [2025-03-08 00:58:22,280 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d09902208/e95ad1d33c6941eea07489a2a5bf2449/FLAG9b9c8df20 [2025-03-08 00:58:22,619 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:58:22,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label06.c [2025-03-08 00:58:22,642 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d09902208/e95ad1d33c6941eea07489a2a5bf2449/FLAG9b9c8df20 [2025-03-08 00:58:22,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d09902208/e95ad1d33c6941eea07489a2a5bf2449 [2025-03-08 00:58:22,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:58:22,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:58:22,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:58:22,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:58:22,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:58:22,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:58:22" (1/1) ... [2025-03-08 00:58:22,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f9fcaa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:22, skipping insertion in model container [2025-03-08 00:58:22,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:58:22" (1/1) ... [2025-03-08 00:58:22,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:58:23,107 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label06.c[21333,21346] [2025-03-08 00:58:23,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:58:23,143 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:58:23,192 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label06.c[21333,21346] [2025-03-08 00:58:23,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:58:23,208 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:58:23,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:23 WrapperNode [2025-03-08 00:58:23,212 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:58:23,213 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:58:23,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:58:23,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:58:23,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:23" (1/1) ... [2025-03-08 00:58:23,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:23" (1/1) ... [2025-03-08 00:58:23,281 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666 [2025-03-08 00:58:23,281 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:58:23,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:58:23,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:58:23,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:58:23,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:23" (1/1) ... [2025-03-08 00:58:23,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:23" (1/1) ... [2025-03-08 00:58:23,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:23" (1/1) ... [2025-03-08 00:58:23,306 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-03-08 00:58:23,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:23" (1/1) ... [2025-03-08 00:58:23,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:23" (1/1) ... [2025-03-08 00:58:23,317 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:23" (1/1) ... [2025-03-08 00:58:23,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:23" (1/1) ... [2025-03-08 00:58:23,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:23" (1/1) ... [2025-03-08 00:58:23,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:23" (1/1) ... [2025-03-08 00:58:23,329 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:58:23,330 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:58:23,330 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:58:23,330 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:58:23,334 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:23" (1/1) ... [2025-03-08 00:58:23,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:58:23,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:58:23,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:58:23,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:58:23,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:58:23,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:58:23,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:58:23,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:58:23,443 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:58:23,444 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:58:24,135 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-08 00:58:24,136 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:58:24,149 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:58:24,150 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:58:24,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:58:24 BoogieIcfgContainer [2025-03-08 00:58:24,150 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:58:24,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:58:24,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:58:24,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:58:24,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:58:22" (1/3) ... [2025-03-08 00:58:24,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39965c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:58:24, skipping insertion in model container [2025-03-08 00:58:24,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:23" (2/3) ... [2025-03-08 00:58:24,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39965c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:58:24, skipping insertion in model container [2025-03-08 00:58:24,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:58:24" (3/3) ... [2025-03-08 00:58:24,158 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem02_label06.c [2025-03-08 00:58:24,170 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:58:24,171 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label06.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 00:58:24,216 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:58:24,226 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;@6632436b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:58:24,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:58:24,229 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-03-08 00:58:24,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 00:58:24,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:58:24,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:58:24,238 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:58:24,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:58:24,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1419923022, now seen corresponding path program 1 times [2025-03-08 00:58:24,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:58:24,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195931342] [2025-03-08 00:58:24,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:58:24,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:58:24,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 00:58:24,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 00:58:24,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:58:24,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:58:24,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:58:24,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:58:24,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195931342] [2025-03-08 00:58:24,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195931342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:58:24,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:58:24,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:58:24,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120177933] [2025-03-08 00:58:24,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:58:24,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:58:24,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:58:24,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:58:24,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:58:24,741 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 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:58:25,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:58:25,301 INFO L93 Difference]: Finished difference Result 596 states and 1027 transitions. [2025-03-08 00:58:25,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:58:25,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2025-03-08 00:58:25,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:58:25,309 INFO L225 Difference]: With dead ends: 596 [2025-03-08 00:58:25,309 INFO L226 Difference]: Without dead ends: 305 [2025-03-08 00:58:25,311 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-03-08 00:58:25,313 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 104 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:58:25,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 89 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:58:25,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-08 00:58:25,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2025-03-08 00:58:25,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.5263157894736843) internal successors, (464), 304 states have internal predecessors, (464), 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-03-08 00:58:25,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 464 transitions. [2025-03-08 00:58:25,346 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 464 transitions. Word has length 140 [2025-03-08 00:58:25,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:58:25,347 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 464 transitions. [2025-03-08 00:58:25,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:58:25,348 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions. [2025-03-08 00:58:25,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 00:58:25,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:58:25,354 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:58:25,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:58:25,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:58:25,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:58:25,355 INFO L85 PathProgramCache]: Analyzing trace with hash 772931904, now seen corresponding path program 1 times [2025-03-08 00:58:25,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:58:25,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744530586] [2025-03-08 00:58:25,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:58:25,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:58:25,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 00:58:25,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 00:58:25,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:58:25,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:58:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:58:25,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:58:25,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744530586] [2025-03-08 00:58:25,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744530586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:58:25,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:58:25,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:58:25,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390556711] [2025-03-08 00:58:25,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:58:25,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:58:25,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:58:25,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:58:25,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:58:25,534 INFO L87 Difference]: Start difference. First operand 305 states and 464 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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-03-08 00:58:25,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:58:25,913 INFO L93 Difference]: Finished difference Result 900 states and 1374 transitions. [2025-03-08 00:58:25,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:58:25,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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 151 [2025-03-08 00:58:25,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:58:25,915 INFO L225 Difference]: With dead ends: 900 [2025-03-08 00:58:25,915 INFO L226 Difference]: Without dead ends: 597 [2025-03-08 00:58:25,916 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-03-08 00:58:25,917 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 191 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:58:25,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 72 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:58:25,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-08 00:58:25,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 456. [2025-03-08 00:58:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.4901098901098901) internal successors, (678), 455 states have internal predecessors, (678), 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-03-08 00:58:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 678 transitions. [2025-03-08 00:58:25,930 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 678 transitions. Word has length 151 [2025-03-08 00:58:25,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:58:25,931 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 678 transitions. [2025-03-08 00:58:25,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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-03-08 00:58:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 678 transitions. [2025-03-08 00:58:25,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 00:58:25,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:58:25,933 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:58:25,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:58:25,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:58:25,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:58:25,934 INFO L85 PathProgramCache]: Analyzing trace with hash -625697427, now seen corresponding path program 1 times [2025-03-08 00:58:25,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:58:25,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603221853] [2025-03-08 00:58:25,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:58:25,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:58:25,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 00:58:25,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 00:58:25,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:58:25,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:58:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:58:26,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:58:26,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603221853] [2025-03-08 00:58:26,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603221853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:58:26,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:58:26,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:58:26,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361254471] [2025-03-08 00:58:26,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:58:26,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:58:26,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:58:26,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:58:26,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:58:26,099 INFO L87 Difference]: Start difference. First operand 456 states and 678 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 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-03-08 00:58:26,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:58:26,422 INFO L93 Difference]: Finished difference Result 1352 states and 2016 transitions. [2025-03-08 00:58:26,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:58:26,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 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 158 [2025-03-08 00:58:26,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:58:26,425 INFO L225 Difference]: With dead ends: 1352 [2025-03-08 00:58:26,425 INFO L226 Difference]: Without dead ends: 898 [2025-03-08 00:58:26,426 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-03-08 00:58:26,427 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 158 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:58:26,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 125 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:58:26,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2025-03-08 00:58:26,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 889. [2025-03-08 00:58:26,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 1.4391891891891893) internal successors, (1278), 888 states have internal predecessors, (1278), 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-03-08 00:58:26,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1278 transitions. [2025-03-08 00:58:26,449 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1278 transitions. Word has length 158 [2025-03-08 00:58:26,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:58:26,450 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1278 transitions. [2025-03-08 00:58:26,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 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-03-08 00:58:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1278 transitions. [2025-03-08 00:58:26,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 00:58:26,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:58:26,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:58:26,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:58:26,452 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:58:26,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:58:26,453 INFO L85 PathProgramCache]: Analyzing trace with hash 786943587, now seen corresponding path program 1 times [2025-03-08 00:58:26,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:58:26,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846841800] [2025-03-08 00:58:26,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:58:26,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:58:26,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 00:58:26,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 00:58:26,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:58:26,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:58:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:58:26,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:58:26,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846841800] [2025-03-08 00:58:26,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846841800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:58:26,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:58:26,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:58:26,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613704309] [2025-03-08 00:58:26,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:58:26,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:58:26,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:58:26,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:58:26,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:58:26,568 INFO L87 Difference]: Start difference. First operand 889 states and 1278 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 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-03-08 00:58:26,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:58:26,933 INFO L93 Difference]: Finished difference Result 2619 states and 3774 transitions. [2025-03-08 00:58:26,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:58:26,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 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 162 [2025-03-08 00:58:26,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:58:26,939 INFO L225 Difference]: With dead ends: 2619 [2025-03-08 00:58:26,940 INFO L226 Difference]: Without dead ends: 1732 [2025-03-08 00:58:26,941 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-03-08 00:58:26,942 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 177 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 76 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-03-08 00:58:26,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 76 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:58:26,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2025-03-08 00:58:26,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1732. [2025-03-08 00:58:26,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1731 states have (on average 1.3645291738879262) internal successors, (2362), 1731 states have internal predecessors, (2362), 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-03-08 00:58:26,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2362 transitions. [2025-03-08 00:58:26,990 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2362 transitions. Word has length 162 [2025-03-08 00:58:26,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:58:26,990 INFO L471 AbstractCegarLoop]: Abstraction has 1732 states and 2362 transitions. [2025-03-08 00:58:26,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 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-03-08 00:58:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2362 transitions. [2025-03-08 00:58:26,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 00:58:26,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:58:26,994 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:58:26,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:58:26,994 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:58:26,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:58:26,995 INFO L85 PathProgramCache]: Analyzing trace with hash -51091952, now seen corresponding path program 1 times [2025-03-08 00:58:26,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:58:26,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815731648] [2025-03-08 00:58:26,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:58:26,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:58:27,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 00:58:27,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 00:58:27,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:58:27,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:58:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:58:27,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:58:27,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815731648] [2025-03-08 00:58:27,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815731648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:58:27,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:58:27,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:58:27,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443589074] [2025-03-08 00:58:27,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:58:27,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:58:27,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:58:27,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:58:27,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:58:27,113 INFO L87 Difference]: Start difference. First operand 1732 states and 2362 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-03-08 00:58:27,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:58:27,530 INFO L93 Difference]: Finished difference Result 4722 states and 6404 transitions. [2025-03-08 00:58:27,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:58:27,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 162 [2025-03-08 00:58:27,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:58:27,540 INFO L225 Difference]: With dead ends: 4722 [2025-03-08 00:58:27,540 INFO L226 Difference]: Without dead ends: 2992 [2025-03-08 00:58:27,541 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-03-08 00:58:27,543 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 149 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:58:27,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 88 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:58:27,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2025-03-08 00:58:27,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2572. [2025-03-08 00:58:27,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2572 states, 2571 states have (on average 1.292882147024504) internal successors, (3324), 2571 states have internal predecessors, (3324), 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-03-08 00:58:27,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2572 states and 3324 transitions. [2025-03-08 00:58:27,587 INFO L78 Accepts]: Start accepts. Automaton has 2572 states and 3324 transitions. Word has length 162 [2025-03-08 00:58:27,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:58:27,587 INFO L471 AbstractCegarLoop]: Abstraction has 2572 states and 3324 transitions. [2025-03-08 00:58:27,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-03-08 00:58:27,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 3324 transitions. [2025-03-08 00:58:27,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 00:58:27,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:58:27,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:58:27,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 00:58:27,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:58:27,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:58:27,593 INFO L85 PathProgramCache]: Analyzing trace with hash -141915424, now seen corresponding path program 1 times [2025-03-08 00:58:27,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:58:27,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543610371] [2025-03-08 00:58:27,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:58:27,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:58:27,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 00:58:27,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 00:58:27,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:58:27,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:58:27,903 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:58:27,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:58:27,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543610371] [2025-03-08 00:58:27,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543610371] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:58:27,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244185310] [2025-03-08 00:58:27,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:58:27,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:58:27,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:58:27,908 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:58:27,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:58:27,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 00:58:27,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 00:58:27,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:58:27,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:58:27,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:58:27,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:58:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:58:28,148 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:58:28,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244185310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:58:28,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:58:28,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 00:58:28,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555469508] [2025-03-08 00:58:28,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:58:28,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:58:28,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:58:28,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:58:28,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:58:28,149 INFO L87 Difference]: Start difference. First operand 2572 states and 3324 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-03-08 00:58:28,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:58:28,491 INFO L93 Difference]: Finished difference Result 5140 states and 6644 transitions. [2025-03-08 00:58:28,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:58:28,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 167 [2025-03-08 00:58:28,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:58:28,499 INFO L225 Difference]: With dead ends: 5140 [2025-03-08 00:58:28,499 INFO L226 Difference]: Without dead ends: 2570 [2025-03-08 00:58:28,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:58:28,502 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 23 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:58:28,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 246 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:58:28,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2025-03-08 00:58:28,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2570. [2025-03-08 00:58:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2570 states, 2569 states have (on average 1.1946282600233553) internal successors, (3069), 2569 states have internal predecessors, (3069), 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-03-08 00:58:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 3069 transitions. [2025-03-08 00:58:28,554 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 3069 transitions. Word has length 167 [2025-03-08 00:58:28,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:58:28,555 INFO L471 AbstractCegarLoop]: Abstraction has 2570 states and 3069 transitions. [2025-03-08 00:58:28,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-03-08 00:58:28,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3069 transitions. [2025-03-08 00:58:28,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-08 00:58:28,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:58:28,562 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:58:28,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 00:58:28,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 00:58:28,767 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:58:28,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:58:28,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2077898299, now seen corresponding path program 1 times [2025-03-08 00:58:28,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:58:28,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665837581] [2025-03-08 00:58:28,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:58:28,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:58:28,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-08 00:58:28,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-08 00:58:28,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:58:28,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:58:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:58:28,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:58:28,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665837581] [2025-03-08 00:58:28,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665837581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:58:28,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:58:28,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:58:28,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215627939] [2025-03-08 00:58:28,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:58:28,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:58:28,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:58:28,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:58:28,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:58:28,903 INFO L87 Difference]: Start difference. First operand 2570 states and 3069 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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-03-08 00:58:29,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:58:29,250 INFO L93 Difference]: Finished difference Result 6117 states and 7246 transitions. [2025-03-08 00:58:29,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:58:29,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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-03-08 00:58:29,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:58:29,260 INFO L225 Difference]: With dead ends: 6117 [2025-03-08 00:58:29,260 INFO L226 Difference]: Without dead ends: 3549 [2025-03-08 00:58:29,263 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-03-08 00:58:29,263 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 100 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:58:29,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 222 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:58:29,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3549 states. [2025-03-08 00:58:29,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3549 to 3547. [2025-03-08 00:58:29,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3547 states, 3546 states have (on average 1.1283135927805978) internal successors, (4001), 3546 states have internal predecessors, (4001), 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-03-08 00:58:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3547 states to 3547 states and 4001 transitions. [2025-03-08 00:58:29,313 INFO L78 Accepts]: Start accepts. Automaton has 3547 states and 4001 transitions. Word has length 217 [2025-03-08 00:58:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:58:29,314 INFO L471 AbstractCegarLoop]: Abstraction has 3547 states and 4001 transitions. [2025-03-08 00:58:29,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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-03-08 00:58:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3547 states and 4001 transitions. [2025-03-08 00:58:29,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-08 00:58:29,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:58:29,319 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 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] [2025-03-08 00:58:29,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 00:58:29,320 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:58:29,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:58:29,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1852450909, now seen corresponding path program 1 times [2025-03-08 00:58:29,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:58:29,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295776653] [2025-03-08 00:58:29,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:58:29,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:58:29,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-08 00:58:29,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-08 00:58:29,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:58:29,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:58:29,406 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-08 00:58:29,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:58:29,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295776653] [2025-03-08 00:58:29,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295776653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:58:29,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:58:29,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:58:29,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946455667] [2025-03-08 00:58:29,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:58:29,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:58:29,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:58:29,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:58:29,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:58:29,408 INFO L87 Difference]: Start difference. First operand 3547 states and 4001 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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-03-08 00:58:29,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:58:29,623 INFO L93 Difference]: Finished difference Result 6800 states and 7659 transitions. [2025-03-08 00:58:29,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:58:29,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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 223 [2025-03-08 00:58:29,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:58:29,634 INFO L225 Difference]: With dead ends: 6800 [2025-03-08 00:58:29,634 INFO L226 Difference]: Without dead ends: 3255 [2025-03-08 00:58:29,637 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-03-08 00:58:29,638 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 203 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:58:29,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 21 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:58:29,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3255 states. [2025-03-08 00:58:29,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3255 to 3255. [2025-03-08 00:58:29,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3255 states, 3254 states have (on average 1.1124769514443762) internal successors, (3620), 3254 states have internal predecessors, (3620), 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-03-08 00:58:29,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 3620 transitions. [2025-03-08 00:58:29,689 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 3620 transitions. Word has length 223 [2025-03-08 00:58:29,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:58:29,689 INFO L471 AbstractCegarLoop]: Abstraction has 3255 states and 3620 transitions. [2025-03-08 00:58:29,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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-03-08 00:58:29,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 3620 transitions. [2025-03-08 00:58:29,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-08 00:58:29,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:58:29,697 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 00:58:29,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 00:58:29,697 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:58:29,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:58:29,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1093446709, now seen corresponding path program 1 times [2025-03-08 00:58:29,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:58:29,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102838485] [2025-03-08 00:58:29,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:58:29,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:58:29,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-08 00:58:29,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-08 00:58:29,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:58:29,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:58:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:58:29,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:58:29,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102838485] [2025-03-08 00:58:29,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102838485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:58:29,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:58:29,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:58:29,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649918145] [2025-03-08 00:58:29,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:58:29,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:58:29,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:58:29,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:58:29,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:58:29,817 INFO L87 Difference]: Start difference. First operand 3255 states and 3620 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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-03-08 00:58:30,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:58:30,174 INFO L93 Difference]: Finished difference Result 5235 states and 5824 transitions. [2025-03-08 00:58:30,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:58:30,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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 233 [2025-03-08 00:58:30,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:58:30,183 INFO L225 Difference]: With dead ends: 5235 [2025-03-08 00:58:30,183 INFO L226 Difference]: Without dead ends: 3114 [2025-03-08 00:58:30,186 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-03-08 00:58:30,189 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 80 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:58:30,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 240 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:58:30,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2025-03-08 00:58:30,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 3114. [2025-03-08 00:58:30,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3114 states, 3113 states have (on average 1.0925152585929971) internal successors, (3401), 3113 states have internal predecessors, (3401), 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-03-08 00:58:30,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 3401 transitions. [2025-03-08 00:58:30,256 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 3401 transitions. Word has length 233 [2025-03-08 00:58:30,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:58:30,256 INFO L471 AbstractCegarLoop]: Abstraction has 3114 states and 3401 transitions. [2025-03-08 00:58:30,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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-03-08 00:58:30,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 3401 transitions. [2025-03-08 00:58:30,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-03-08 00:58:30,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:58:30,261 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 00:58:30,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 00:58:30,261 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:58:30,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:58:30,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1127537969, now seen corresponding path program 1 times [2025-03-08 00:58:30,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:58:30,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346884701] [2025-03-08 00:58:30,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:58:30,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:58:30,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-08 00:58:30,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-08 00:58:30,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:58:30,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:58:30,538 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:58:30,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:58:30,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346884701] [2025-03-08 00:58:30,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346884701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:58:30,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:58:30,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:58:30,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661680373] [2025-03-08 00:58:30,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:58:30,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:58:30,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:58:30,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:58:30,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:58:30,539 INFO L87 Difference]: Start difference. First operand 3114 states and 3401 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 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-03-08 00:58:31,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:58:31,039 INFO L93 Difference]: Finished difference Result 5654 states and 6216 transitions. [2025-03-08 00:58:31,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:58:31,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 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 291 [2025-03-08 00:58:31,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:58:31,040 INFO L225 Difference]: With dead ends: 5654 [2025-03-08 00:58:31,040 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 00:58:31,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:58:31,044 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 197 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:58:31,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 229 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:58:31,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 00:58:31,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 00:58:31,045 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-03-08 00:58:31,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 00:58:31,045 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 291 [2025-03-08 00:58:31,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:58:31,045 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 00:58:31,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 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-03-08 00:58:31,045 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 00:58:31,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 00:58:31,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:58:31,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 00:58:31,050 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:58:31,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 00:58:31,318 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:58:31,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:58:31 BoogieIcfgContainer [2025-03-08 00:58:31,334 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:58:31,334 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:58:31,334 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:58:31,334 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:58:31,338 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:58:24" (3/4) ... [2025-03-08 00:58:31,340 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 00:58:31,356 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 00:58:31,356 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 00:58:31,357 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 00:58:31,358 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 00:58:31,457 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 00:58:31,457 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 00:58:31,457 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:58:31,458 INFO L158 Benchmark]: Toolchain (without parser) took 8603.49ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 104.5MB in the beginning and 211.4MB in the end (delta: -106.8MB). Peak memory consumption was 96.3MB. Max. memory is 16.1GB. [2025-03-08 00:58:31,458 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:58:31,458 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.26ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 78.4MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 00:58:31,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.96ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 73.4MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:58:31,459 INFO L158 Benchmark]: Boogie Preprocessor took 47.80ms. Allocated memory is still 142.6MB. Free memory was 73.4MB in the beginning and 70.1MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:58:31,459 INFO L158 Benchmark]: IcfgBuilder took 819.93ms. Allocated memory is still 142.6MB. Free memory was 70.1MB in the beginning and 59.4MB in the end (delta: 10.8MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. [2025-03-08 00:58:31,459 INFO L158 Benchmark]: TraceAbstraction took 7182.16ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 58.6MB in the beginning and 224.2MB in the end (delta: -165.6MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2025-03-08 00:58:31,459 INFO L158 Benchmark]: Witness Printer took 122.79ms. Allocated memory is still 343.9MB. Free memory was 224.2MB in the beginning and 211.4MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 00:58:31,461 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.15ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.26ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 78.4MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.96ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 73.4MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.80ms. Allocated memory is still 142.6MB. Free memory was 73.4MB in the beginning and 70.1MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 819.93ms. Allocated memory is still 142.6MB. Free memory was 70.1MB in the beginning and 59.4MB in the end (delta: 10.8MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7182.16ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 58.6MB in the beginning and 224.2MB in the end (delta: -165.6MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * Witness Printer took 122.79ms. Allocated memory is still 343.9MB. Free memory was 224.2MB in the beginning and 211.4MB in the end (delta: 12.8MB). 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: 602]: 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, 374 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1382 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1382 mSDsluCounter, 1408 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 168 mSDsCounter, 645 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3812 IncrementalHoareTripleChecker+Invalid, 4457 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 645 mSolverCounterUnsat, 1240 mSDtfsCounter, 3812 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3547occurred in iteration=7, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 572 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2071 NumberOfCodeBlocks, 2071 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2060 ConstructedInterpolants, 0 QuantifiedInterpolants, 5278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 680/696 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) && (a11 <= 0)) && (a19 == 1)) && (a25 == 0)) || ((((((9 <= a28) && (a25 == 1)) && (a17 <= 8)) && (a11 <= 0)) && (a28 <= 10)) && (a19 <= 0))) || ((((a17 == 8) && (a28 <= 9)) && (a25 == 0)) && (a19 <= 0))) || ((((a25 == 1) && (a17 <= 8)) && (a11 <= 0)) && (a19 == 1))) || ((((a17 == 8) && (9 <= a28)) && (a19 == 1)) && (a25 == 0))) || (((((a17 == 8) && (9 <= a28)) && (a25 == 1)) && (a28 <= 10)) && (a19 <= 0))) || (((((a28 <= 9) && (a17 <= 8)) && (a11 <= 0)) && (a25 == 0)) && (a19 <= 0))) || (((a28 <= 9) && (a17 <= 7)) && (a19 == 1))) || ((((9 <= a28) && (a17 <= 7)) && (a25 == 0)) && (a19 <= 0))) || (((a17 == 8) && (a25 == 1)) && (a19 == 1))) || (((a17 <= 7) && (a28 == 9)) && (a19 <= 0))) RESULT: Ultimate proved your program to be correct! [2025-03-08 00:58:31,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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