./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label56.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/Problem16_label56.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 1bf9c9ed0ac3089dd8a3bb2d319db37780f9f29fcee029bedf598db4408580eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:07:02,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:07:03,007 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:07:03,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:07:03,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:07:03,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:07:03,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:07:03,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:07:03,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:07:03,031 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:07:03,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:07:03,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:07:03,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:07:03,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:07:03,031 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:07:03,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:07:03,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:07:03,031 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:07:03,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:07:03,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:07:03,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:07:03,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:07:03,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:07:03,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:07:03,032 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:07:03,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:07:03,032 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:07:03,032 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:07:03,032 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:07:03,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:07:03,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:07:03,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:07:03,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:07:03,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:07:03,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:07:03,032 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:07:03,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:07:03,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:07:03,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:07:03,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:07:03,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:07:03,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:07:03,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:07:03,032 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 -> 1bf9c9ed0ac3089dd8a3bb2d319db37780f9f29fcee029bedf598db4408580eb [2025-03-08 02:07:03,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:07:03,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:07:03,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:07:03,298 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:07:03,298 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:07:03,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label56.c [2025-03-08 02:07:04,418 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44ff11b10/6e27ff0830f5405fa4d6a69954fd5bd7/FLAGf6787d56c [2025-03-08 02:07:04,799 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:07:04,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label56.c [2025-03-08 02:07:04,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44ff11b10/6e27ff0830f5405fa4d6a69954fd5bd7/FLAGf6787d56c [2025-03-08 02:07:04,996 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44ff11b10/6e27ff0830f5405fa4d6a69954fd5bd7 [2025-03-08 02:07:04,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:07:05,000 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:07:05,002 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:07:05,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:07:05,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:07:05,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:07:04" (1/1) ... [2025-03-08 02:07:05,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7740330f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:05, skipping insertion in model container [2025-03-08 02:07:05,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:07:04" (1/1) ... [2025-03-08 02:07:05,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:07:05,174 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/Problem16_label56.c[3626,3639] [2025-03-08 02:07:05,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:07:05,379 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:07:05,395 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/Problem16_label56.c[3626,3639] [2025-03-08 02:07:05,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:07:05,519 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:07:05,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:05 WrapperNode [2025-03-08 02:07:05,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:07:05,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:07:05,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:07:05,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:07:05,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:05" (1/1) ... [2025-03-08 02:07:05,554 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:05" (1/1) ... [2025-03-08 02:07:05,662 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-08 02:07:05,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:07:05,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:07:05,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:07:05,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:07:05,670 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:05" (1/1) ... [2025-03-08 02:07:05,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:05" (1/1) ... [2025-03-08 02:07:05,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:05" (1/1) ... [2025-03-08 02:07:05,770 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 02:07:05,770 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:05" (1/1) ... [2025-03-08 02:07:05,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:05" (1/1) ... [2025-03-08 02:07:05,805 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:05" (1/1) ... [2025-03-08 02:07:05,812 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:05" (1/1) ... [2025-03-08 02:07:05,823 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:05" (1/1) ... [2025-03-08 02:07:05,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:05" (1/1) ... [2025-03-08 02:07:05,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:07:05,846 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:07:05,847 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:07:05,847 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:07:05,848 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:05" (1/1) ... [2025-03-08 02:07:05,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:07:05,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:07:05,876 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 02:07:05,882 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 02:07:05,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:07:05,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:07:05,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:07:05,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:07:05,948 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:07:05,950 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:07:07,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-08 02:07:07,765 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-08 02:07:07,765 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:07:07,781 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:07:07,781 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:07:07,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:07:07 BoogieIcfgContainer [2025-03-08 02:07:07,781 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:07:07,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:07:07,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:07:07,787 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:07:07,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:07:04" (1/3) ... [2025-03-08 02:07:07,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67915168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:07:07, skipping insertion in model container [2025-03-08 02:07:07,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:05" (2/3) ... [2025-03-08 02:07:07,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67915168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:07:07, skipping insertion in model container [2025-03-08 02:07:07,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:07:07" (3/3) ... [2025-03-08 02:07:07,789 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label56.c [2025-03-08 02:07:07,800 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:07:07,802 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label56.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:07:07,874 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:07:07,885 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;@2de88b29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:07:07,885 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:07:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 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 02:07:07,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 02:07:07,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:07,896 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] [2025-03-08 02:07:07,897 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:07,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:07,902 INFO L85 PathProgramCache]: Analyzing trace with hash 564886290, now seen corresponding path program 1 times [2025-03-08 02:07:07,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:07,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024858138] [2025-03-08 02:07:07,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:07,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:07,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 02:07:07,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 02:07:07,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:07,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:08,119 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 02:07:08,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:08,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024858138] [2025-03-08 02:07:08,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024858138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:08,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:08,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:07:08,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419330826] [2025-03-08 02:07:08,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:08,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:08,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:08,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:08,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:08,151 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 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 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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 02:07:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:09,614 INFO L93 Difference]: Finished difference Result 1122 states and 2100 transitions. [2025-03-08 02:07:09,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:09,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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 33 [2025-03-08 02:07:09,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:09,627 INFO L225 Difference]: With dead ends: 1122 [2025-03-08 02:07:09,627 INFO L226 Difference]: Without dead ends: 662 [2025-03-08 02:07:09,630 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 02:07:09,632 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 354 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:09,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 254 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:07:09,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-08 02:07:09,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-03-08 02:07:09,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.518910741301059) internal successors, (1004), 661 states have internal predecessors, (1004), 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 02:07:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1004 transitions. [2025-03-08 02:07:09,698 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1004 transitions. Word has length 33 [2025-03-08 02:07:09,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:09,698 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1004 transitions. [2025-03-08 02:07:09,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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 02:07:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1004 transitions. [2025-03-08 02:07:09,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 02:07:09,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:09,702 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:07:09,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:07:09,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:09,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:09,703 INFO L85 PathProgramCache]: Analyzing trace with hash -306629147, now seen corresponding path program 1 times [2025-03-08 02:07:09,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:09,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530021923] [2025-03-08 02:07:09,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:09,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:09,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 02:07:09,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 02:07:09,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:09,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:10,023 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:07:10,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:10,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530021923] [2025-03-08 02:07:10,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530021923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:10,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:10,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:10,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229281500] [2025-03-08 02:07:10,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:10,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:07:10,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:10,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:07:10,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:07:10,025 INFO L87 Difference]: Start difference. First operand 662 states and 1004 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 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 02:07:11,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:11,709 INFO L93 Difference]: Finished difference Result 2309 states and 3414 transitions. [2025-03-08 02:07:11,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:07:11,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2025-03-08 02:07:11,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:11,715 INFO L225 Difference]: With dead ends: 2309 [2025-03-08 02:07:11,715 INFO L226 Difference]: Without dead ends: 1649 [2025-03-08 02:07:11,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:07:11,717 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1006 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:11,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 44 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:07:11,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2025-03-08 02:07:11,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2025-03-08 02:07:11,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1648 states have (on average 1.4010922330097086) internal successors, (2309), 1648 states have internal predecessors, (2309), 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 02:07:11,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2309 transitions. [2025-03-08 02:07:11,767 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2309 transitions. Word has length 101 [2025-03-08 02:07:11,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:11,768 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2309 transitions. [2025-03-08 02:07:11,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 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 02:07:11,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2309 transitions. [2025-03-08 02:07:11,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-08 02:07:11,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:11,779 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 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] [2025-03-08 02:07:11,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:07:11,780 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:11,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:11,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1394318467, now seen corresponding path program 1 times [2025-03-08 02:07:11,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:11,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589048258] [2025-03-08 02:07:11,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:11,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:11,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-08 02:07:11,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-08 02:07:11,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:11,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 02:07:12,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:12,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589048258] [2025-03-08 02:07:12,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589048258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:12,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:12,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:07:12,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986009699] [2025-03-08 02:07:12,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:12,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:12,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:12,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:12,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:12,019 INFO L87 Difference]: Start difference. First operand 1649 states and 2309 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 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 02:07:13,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:13,140 INFO L93 Difference]: Finished difference Result 3625 states and 5239 transitions. [2025-03-08 02:07:13,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:13,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 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 261 [2025-03-08 02:07:13,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:13,147 INFO L225 Difference]: With dead ends: 3625 [2025-03-08 02:07:13,147 INFO L226 Difference]: Without dead ends: 2307 [2025-03-08 02:07:13,149 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 02:07:13,149 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:13,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 77 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:07:13,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-03-08 02:07:13,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-03-08 02:07:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.3490893321769297) internal successors, (3111), 2306 states have internal predecessors, (3111), 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 02:07:13,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3111 transitions. [2025-03-08 02:07:13,190 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3111 transitions. Word has length 261 [2025-03-08 02:07:13,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:13,191 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3111 transitions. [2025-03-08 02:07:13,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 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 02:07:13,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3111 transitions. [2025-03-08 02:07:13,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-08 02:07:13,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:13,197 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:13,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:07:13,197 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:13,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:13,197 INFO L85 PathProgramCache]: Analyzing trace with hash -637376668, now seen corresponding path program 1 times [2025-03-08 02:07:13,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:13,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431479423] [2025-03-08 02:07:13,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:13,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:13,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-08 02:07:13,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-08 02:07:13,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:13,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-08 02:07:13,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:13,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431479423] [2025-03-08 02:07:13,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431479423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:13,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:13,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:07:13,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383435656] [2025-03-08 02:07:13,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:13,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:13,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:13,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:13,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:13,383 INFO L87 Difference]: Start difference. First operand 2307 states and 3111 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 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 02:07:14,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:14,365 INFO L93 Difference]: Finished difference Result 5599 states and 7694 transitions. [2025-03-08 02:07:14,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:14,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 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 296 [2025-03-08 02:07:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:14,376 INFO L225 Difference]: With dead ends: 5599 [2025-03-08 02:07:14,376 INFO L226 Difference]: Without dead ends: 3623 [2025-03-08 02:07:14,378 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 02:07:14,379 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:14,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:07:14,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2025-03-08 02:07:14,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3294. [2025-03-08 02:07:14,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3294 states, 3293 states have (on average 1.2356513817187975) internal successors, (4069), 3293 states have internal predecessors, (4069), 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 02:07:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 4069 transitions. [2025-03-08 02:07:14,429 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 4069 transitions. Word has length 296 [2025-03-08 02:07:14,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:14,429 INFO L471 AbstractCegarLoop]: Abstraction has 3294 states and 4069 transitions. [2025-03-08 02:07:14,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 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 02:07:14,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 4069 transitions. [2025-03-08 02:07:14,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2025-03-08 02:07:14,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:14,435 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-03-08 02:07:14,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:07:14,436 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:14,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:14,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1448147221, now seen corresponding path program 1 times [2025-03-08 02:07:14,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:14,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148078504] [2025-03-08 02:07:14,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:14,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:14,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 549 statements into 1 equivalence classes. [2025-03-08 02:07:14,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 549 of 549 statements. [2025-03-08 02:07:14,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:14,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 693 proven. 0 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2025-03-08 02:07:14,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:14,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148078504] [2025-03-08 02:07:14,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148078504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:14,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:14,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:14,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568356071] [2025-03-08 02:07:14,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:14,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:14,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:14,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:14,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:14,714 INFO L87 Difference]: Start difference. First operand 3294 states and 4069 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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 02:07:15,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:15,683 INFO L93 Difference]: Finished difference Result 7573 states and 9417 transitions. [2025-03-08 02:07:15,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:15,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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 549 [2025-03-08 02:07:15,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:15,693 INFO L225 Difference]: With dead ends: 7573 [2025-03-08 02:07:15,693 INFO L226 Difference]: Without dead ends: 3952 [2025-03-08 02:07:15,697 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 02:07:15,698 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 286 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:15,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 540 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:07:15,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2025-03-08 02:07:15,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2025-03-08 02:07:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.072892938496583) internal successors, (4239), 3951 states have internal predecessors, (4239), 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 02:07:15,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4239 transitions. [2025-03-08 02:07:15,773 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 4239 transitions. Word has length 549 [2025-03-08 02:07:15,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:15,773 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 4239 transitions. [2025-03-08 02:07:15,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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 02:07:15,775 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4239 transitions. [2025-03-08 02:07:15,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2025-03-08 02:07:15,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:15,787 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 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, 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] [2025-03-08 02:07:15,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:07:15,787 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:15,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:15,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1954741465, now seen corresponding path program 1 times [2025-03-08 02:07:15,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:15,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133267052] [2025-03-08 02:07:15,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:15,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:15,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 821 statements into 1 equivalence classes. [2025-03-08 02:07:15,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 821 of 821 statements. [2025-03-08 02:07:15,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:15,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1368 backedges. 1076 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-03-08 02:07:16,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:16,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133267052] [2025-03-08 02:07:16,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133267052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:16,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:16,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:16,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512424509] [2025-03-08 02:07:16,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:16,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:16,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:16,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:16,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:16,476 INFO L87 Difference]: Start difference. First operand 3952 states and 4239 transitions. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 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 02:07:17,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:17,110 INFO L93 Difference]: Finished difference Result 8889 states and 9584 transitions. [2025-03-08 02:07:17,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:17,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 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 821 [2025-03-08 02:07:17,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:17,120 INFO L225 Difference]: With dead ends: 8889 [2025-03-08 02:07:17,120 INFO L226 Difference]: Without dead ends: 5268 [2025-03-08 02:07:17,124 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 02:07:17,124 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 219 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:17,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 428 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:07:17,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2025-03-08 02:07:17,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 5268. [2025-03-08 02:07:17,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5268 states, 5267 states have (on average 1.0599962027719765) internal successors, (5583), 5267 states have internal predecessors, (5583), 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 02:07:17,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 5583 transitions. [2025-03-08 02:07:17,187 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 5583 transitions. Word has length 821 [2025-03-08 02:07:17,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:17,187 INFO L471 AbstractCegarLoop]: Abstraction has 5268 states and 5583 transitions. [2025-03-08 02:07:17,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 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 02:07:17,188 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 5583 transitions. [2025-03-08 02:07:17,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 885 [2025-03-08 02:07:17,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:17,202 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 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, 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] [2025-03-08 02:07:17,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:07:17,202 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:17,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:17,202 INFO L85 PathProgramCache]: Analyzing trace with hash 735233970, now seen corresponding path program 1 times [2025-03-08 02:07:17,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:17,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32282569] [2025-03-08 02:07:17,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:17,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:17,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 884 statements into 1 equivalence classes. [2025-03-08 02:07:17,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 884 of 884 statements. [2025-03-08 02:07:17,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:17,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:17,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1523 backedges. 1078 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-03-08 02:07:17,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:17,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32282569] [2025-03-08 02:07:17,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32282569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:17,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:17,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:17,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465216781] [2025-03-08 02:07:17,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:17,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:17,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:17,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:17,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:17,685 INFO L87 Difference]: Start difference. First operand 5268 states and 5583 transitions. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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 02:07:18,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:18,356 INFO L93 Difference]: Finished difference Result 11850 states and 12616 transitions. [2025-03-08 02:07:18,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:18,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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 884 [2025-03-08 02:07:18,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:18,371 INFO L225 Difference]: With dead ends: 11850 [2025-03-08 02:07:18,371 INFO L226 Difference]: Without dead ends: 6913 [2025-03-08 02:07:18,376 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 02:07:18,377 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 175 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:18,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 414 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:07:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6913 states. [2025-03-08 02:07:18,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6913 to 6584. [2025-03-08 02:07:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6584 states, 6583 states have (on average 1.0446604891386906) internal successors, (6877), 6583 states have internal predecessors, (6877), 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 02:07:18,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6584 states to 6584 states and 6877 transitions. [2025-03-08 02:07:18,453 INFO L78 Accepts]: Start accepts. Automaton has 6584 states and 6877 transitions. Word has length 884 [2025-03-08 02:07:18,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:18,454 INFO L471 AbstractCegarLoop]: Abstraction has 6584 states and 6877 transitions. [2025-03-08 02:07:18,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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 02:07:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 6584 states and 6877 transitions. [2025-03-08 02:07:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1258 [2025-03-08 02:07:18,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:18,467 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:18,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:07:18,467 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:18,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:18,468 INFO L85 PathProgramCache]: Analyzing trace with hash -105339516, now seen corresponding path program 1 times [2025-03-08 02:07:18,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:18,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657520696] [2025-03-08 02:07:18,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:18,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:18,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1257 statements into 1 equivalence classes. [2025-03-08 02:07:18,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1257 of 1257 statements. [2025-03-08 02:07:18,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:18,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2833 backedges. 1609 proven. 0 refuted. 0 times theorem prover too weak. 1224 trivial. 0 not checked. [2025-03-08 02:07:19,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:19,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657520696] [2025-03-08 02:07:19,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657520696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:19,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:19,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:19,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673161900] [2025-03-08 02:07:19,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:19,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:19,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:19,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:19,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:19,595 INFO L87 Difference]: Start difference. First operand 6584 states and 6877 transitions. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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 02:07:20,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:20,242 INFO L93 Difference]: Finished difference Result 13824 states and 14473 transitions. [2025-03-08 02:07:20,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:20,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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 1257 [2025-03-08 02:07:20,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:20,258 INFO L225 Difference]: With dead ends: 13824 [2025-03-08 02:07:20,258 INFO L226 Difference]: Without dead ends: 7571 [2025-03-08 02:07:20,264 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 02:07:20,264 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:20,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 439 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:07:20,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2025-03-08 02:07:20,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7571. [2025-03-08 02:07:20,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7571 states, 7570 states have (on average 1.0397622192866578) internal successors, (7871), 7570 states have internal predecessors, (7871), 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 02:07:20,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 7871 transitions. [2025-03-08 02:07:20,346 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 7871 transitions. Word has length 1257 [2025-03-08 02:07:20,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:20,347 INFO L471 AbstractCegarLoop]: Abstraction has 7571 states and 7871 transitions. [2025-03-08 02:07:20,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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 02:07:20,347 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 7871 transitions. [2025-03-08 02:07:20,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1276 [2025-03-08 02:07:20,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:20,361 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:20,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:07:20,361 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:20,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:20,362 INFO L85 PathProgramCache]: Analyzing trace with hash -324355597, now seen corresponding path program 1 times [2025-03-08 02:07:20,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:20,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131342401] [2025-03-08 02:07:20,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:20,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:20,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1275 statements into 1 equivalence classes. [2025-03-08 02:07:20,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1275 of 1275 statements. [2025-03-08 02:07:20,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:20,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2863 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 2647 trivial. 0 not checked. [2025-03-08 02:07:20,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:20,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131342401] [2025-03-08 02:07:20,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131342401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:20,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:20,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:20,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358146615] [2025-03-08 02:07:20,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:20,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:20,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:20,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:20,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:20,964 INFO L87 Difference]: Start difference. First operand 7571 states and 7871 transitions. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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 02:07:21,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:21,625 INFO L93 Difference]: Finished difference Result 16125 states and 16847 transitions. [2025-03-08 02:07:21,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:21,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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 1275 [2025-03-08 02:07:21,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:21,626 INFO L225 Difference]: With dead ends: 16125 [2025-03-08 02:07:21,626 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 02:07:21,634 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 02:07:21,635 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 299 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:21,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 432 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:07:21,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 02:07:21,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 02:07:21,636 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 02:07:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 02:07:21,637 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1275 [2025-03-08 02:07:21,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:21,637 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 02:07:21,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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 02:07:21,637 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 02:07:21,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 02:07:21,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 02:07:21,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:07:21,642 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:21,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 02:07:21,753 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 02:07:21,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:07:21 BoogieIcfgContainer [2025-03-08 02:07:21,765 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 02:07:21,766 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 02:07:21,766 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 02:07:21,766 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 02:07:21,766 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:07:07" (3/4) ... [2025-03-08 02:07:21,767 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 02:07:21,792 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-08 02:07:21,793 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 02:07:21,795 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 02:07:21,796 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 02:07:21,919 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 02:07:21,919 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 02:07:21,919 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 02:07:21,920 INFO L158 Benchmark]: Toolchain (without parser) took 16919.84ms. Allocated memory was 167.8MB in the beginning and 679.5MB in the end (delta: 511.7MB). Free memory was 118.2MB in the beginning and 285.7MB in the end (delta: -167.5MB). Peak memory consumption was 343.9MB. Max. memory is 16.1GB. [2025-03-08 02:07:21,920 INFO L158 Benchmark]: CDTParser took 1.08ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:07:21,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.32ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 59.1MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-08 02:07:21,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 139.92ms. Allocated memory is still 167.8MB. Free memory was 59.1MB in the beginning and 36.4MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 02:07:21,921 INFO L158 Benchmark]: Boogie Preprocessor took 182.51ms. Allocated memory is still 167.8MB. Free memory was 36.4MB in the beginning and 78.5MB in the end (delta: -42.1MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2025-03-08 02:07:21,921 INFO L158 Benchmark]: IcfgBuilder took 1935.02ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 78.5MB in the beginning and 224.5MB in the end (delta: -146.0MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2025-03-08 02:07:21,921 INFO L158 Benchmark]: TraceAbstraction took 13982.04ms. Allocated memory was 360.7MB in the beginning and 679.5MB in the end (delta: 318.8MB). Free memory was 224.5MB in the beginning and 310.7MB in the end (delta: -86.2MB). Peak memory consumption was 238.8MB. Max. memory is 16.1GB. [2025-03-08 02:07:21,921 INFO L158 Benchmark]: Witness Printer took 153.77ms. Allocated memory is still 679.5MB. Free memory was 310.7MB in the beginning and 285.7MB in the end (delta: 25.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 02:07:21,922 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.08ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 520.32ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 59.1MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 139.92ms. Allocated memory is still 167.8MB. Free memory was 59.1MB in the beginning and 36.4MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 182.51ms. Allocated memory is still 167.8MB. Free memory was 36.4MB in the beginning and 78.5MB in the end (delta: -42.1MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. * IcfgBuilder took 1935.02ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 78.5MB in the beginning and 224.5MB in the end (delta: -146.0MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. * TraceAbstraction took 13982.04ms. Allocated memory was 360.7MB in the beginning and 679.5MB in the end (delta: 318.8MB). Free memory was 224.5MB in the beginning and 310.7MB in the end (delta: -86.2MB). Peak memory consumption was 238.8MB. Max. memory is 16.1GB. * Witness Printer took 153.77ms. Allocated memory is still 679.5MB. Free memory was 310.7MB in the beginning and 285.7MB in the end (delta: 25.1MB). 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: 116]: 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, 396 locations, 722 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.8s, OverallIterations: 9, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3200 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3200 mSDsluCounter, 2783 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 2202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7877 IncrementalHoareTripleChecker+Invalid, 10079 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2202 mSolverCounterUnsat, 2728 mSDtfsCounter, 7877 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7571occurred in iteration=8, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 658 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 5477 NumberOfCodeBlocks, 5477 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 5468 ConstructedInterpolants, 0 QuantifiedInterpolants, 8460 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 10200/10200 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: 1783]: Location Invariant Derived location invariant: ((((((a12 == 6) && (a16 <= 11)) || ((a16 != 10) && (a15 <= 3))) || ((a15 <= 3) && (a12 == 8))) || ((a12 <= 5) && (a16 <= 11))) || ((a16 != 10) && (a16 <= 11))) RESULT: Ultimate proved your program to be correct! [2025-03-08 02:07:21,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE