./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label53.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem14_label53.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 f09951f8169d75602552a0c69d410baacae8493e4742c50eb18d4008647dffd9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:48:44,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:48:44,119 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:48:44,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:48:44,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:48:44,137 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:48:44,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:48:44,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:48:44,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:48:44,138 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:48:44,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:48:44,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:48:44,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:48:44,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:48:44,139 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:48:44,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:48:44,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:48:44,139 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:48:44,139 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:48:44,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:48:44,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:48:44,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:48:44,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:48:44,139 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:48:44,139 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:48:44,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:48:44,140 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:48:44,140 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:48:44,140 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:48:44,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:48:44,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:48:44,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:48:44,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:48:44,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:48:44,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:48:44,140 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:48:44,140 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:48:44,140 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:48:44,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:48:44,140 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:48:44,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:48:44,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:48:44,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:48:44,140 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 -> f09951f8169d75602552a0c69d410baacae8493e4742c50eb18d4008647dffd9 [2025-03-03 10:48:44,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:48:44,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:48:44,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:48:44,357 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:48:44,357 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:48:44,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label53.c [2025-03-03 10:48:45,481 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1832fe362/14114cc9c54a4d199998bd51a2bf9b03/FLAGa1290c699 [2025-03-03 10:48:45,754 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:48:45,758 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label53.c [2025-03-03 10:48:45,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1832fe362/14114cc9c54a4d199998bd51a2bf9b03/FLAGa1290c699 [2025-03-03 10:48:46,055 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1832fe362/14114cc9c54a4d199998bd51a2bf9b03 [2025-03-03 10:48:46,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:48:46,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:48:46,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:48:46,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:48:46,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:48:46,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:48:46" (1/1) ... [2025-03-03 10:48:46,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58f6f35a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:48:46, skipping insertion in model container [2025-03-03 10:48:46,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:48:46" (1/1) ... [2025-03-03 10:48:46,092 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:48:46,271 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/Problem14_label53.c[5103,5116] [2025-03-03 10:48:46,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:48:46,445 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:48:46,462 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/Problem14_label53.c[5103,5116] [2025-03-03 10:48:46,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:48:46,539 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:48:46,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:48:46 WrapperNode [2025-03-03 10:48:46,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:48:46,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:48:46,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:48:46,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:48:46,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:48:46" (1/1) ... [2025-03-03 10:48:46,561 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:48:46" (1/1) ... [2025-03-03 10:48:46,630 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-03-03 10:48:46,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:48:46,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:48:46,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:48:46,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:48:46,638 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:48:46" (1/1) ... [2025-03-03 10:48:46,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:48:46" (1/1) ... [2025-03-03 10:48:46,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:48:46" (1/1) ... [2025-03-03 10:48:46,680 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-03 10:48:46,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:48:46" (1/1) ... [2025-03-03 10:48:46,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:48:46" (1/1) ... [2025-03-03 10:48:46,711 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:48:46" (1/1) ... [2025-03-03 10:48:46,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:48:46" (1/1) ... [2025-03-03 10:48:46,716 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:48:46" (1/1) ... [2025-03-03 10:48:46,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:48:46" (1/1) ... [2025-03-03 10:48:46,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:48:46,731 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:48:46,731 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:48:46,732 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:48:46,732 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:48:46" (1/1) ... [2025-03-03 10:48:46,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:48:46,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:48:46,758 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:48:46,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:48:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:48:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:48:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:48:46,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:48:46,833 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:48:46,835 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:48:47,831 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-03 10:48:47,832 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:48:47,845 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:48:47,849 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:48:47,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:48:47 BoogieIcfgContainer [2025-03-03 10:48:47,849 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:48:47,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:48:47,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:48:47,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:48:47,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:48:46" (1/3) ... [2025-03-03 10:48:47,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e832fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:48:47, skipping insertion in model container [2025-03-03 10:48:47,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:48:46" (2/3) ... [2025-03-03 10:48:47,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e832fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:48:47, skipping insertion in model container [2025-03-03 10:48:47,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:48:47" (3/3) ... [2025-03-03 10:48:47,856 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label53.c [2025-03-03 10:48:47,867 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:48:47,868 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label53.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:48:47,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:48:47,926 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;@7caaef7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:48:47,926 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:48:47,930 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 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-03 10:48:47,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 10:48:47,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:47,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:48:47,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:47,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:47,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2123096115, now seen corresponding path program 1 times [2025-03-03 10:48:47,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:47,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258408149] [2025-03-03 10:48:47,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:47,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:47,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 10:48:48,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 10:48:48,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:48,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:48,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:48:48,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:48,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258408149] [2025-03-03 10:48:48,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258408149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:48,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:48:48,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:48:48,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046738161] [2025-03-03 10:48:48,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:48,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:48:48,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:48,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:48:48,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:48:48,214 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 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 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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-03 10:48:48,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:48,920 INFO L93 Difference]: Finished difference Result 669 states and 1197 transitions. [2025-03-03 10:48:48,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:48:48,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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 49 [2025-03-03 10:48:48,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:48,928 INFO L225 Difference]: With dead ends: 669 [2025-03-03 10:48:48,929 INFO L226 Difference]: Without dead ends: 360 [2025-03-03 10:48:48,931 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-03 10:48:48,933 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 161 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:48,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 94 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:48:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-03 10:48:48,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-03 10:48:48,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.5208913649025069) internal successors, (546), 359 states have internal predecessors, (546), 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-03 10:48:48,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 546 transitions. [2025-03-03 10:48:48,972 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 546 transitions. Word has length 49 [2025-03-03 10:48:48,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:48,973 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 546 transitions. [2025-03-03 10:48:48,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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-03 10:48:48,973 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 546 transitions. [2025-03-03 10:48:48,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 10:48:48,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:48,978 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:48:48,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:48:48,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:48,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:48,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1147572184, now seen corresponding path program 1 times [2025-03-03 10:48:48,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:48,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415113278] [2025-03-03 10:48:48,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:48,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:49,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 10:48:49,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 10:48:49,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:49,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:49,220 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:48:49,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:49,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415113278] [2025-03-03 10:48:49,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415113278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:49,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:48:49,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:48:49,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974878207] [2025-03-03 10:48:49,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:49,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:48:49,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:49,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:48:49,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:48:49,225 INFO L87 Difference]: Start difference. First operand 360 states and 546 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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-03 10:48:49,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:49,735 INFO L93 Difference]: Finished difference Result 1074 states and 1633 transitions. [2025-03-03 10:48:49,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:48:49,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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 124 [2025-03-03 10:48:49,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:49,738 INFO L225 Difference]: With dead ends: 1074 [2025-03-03 10:48:49,738 INFO L226 Difference]: Without dead ends: 716 [2025-03-03 10:48:49,739 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-03 10:48:49,740 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 122 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:49,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 95 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:48:49,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-03-03 10:48:49,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2025-03-03 10:48:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.353846153846154) internal successors, (968), 715 states have internal predecessors, (968), 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-03 10:48:49,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 968 transitions. [2025-03-03 10:48:49,761 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 968 transitions. Word has length 124 [2025-03-03 10:48:49,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:49,761 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 968 transitions. [2025-03-03 10:48:49,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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-03 10:48:49,761 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 968 transitions. [2025-03-03 10:48:49,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 10:48:49,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:49,763 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:48:49,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:48:49,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:49,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:49,764 INFO L85 PathProgramCache]: Analyzing trace with hash -359979678, now seen corresponding path program 1 times [2025-03-03 10:48:49,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:49,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448846814] [2025-03-03 10:48:49,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:49,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:49,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 10:48:49,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 10:48:49,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:49,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:48:50,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:50,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448846814] [2025-03-03 10:48:50,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448846814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:50,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:48:50,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:48:50,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988687700] [2025-03-03 10:48:50,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:50,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:48:50,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:50,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:48:50,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:48:50,057 INFO L87 Difference]: Start difference. First operand 716 states and 968 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 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-03 10:48:50,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:50,829 INFO L93 Difference]: Finished difference Result 1964 states and 2570 transitions. [2025-03-03 10:48:50,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:48:50,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 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 128 [2025-03-03 10:48:50,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:50,833 INFO L225 Difference]: With dead ends: 1964 [2025-03-03 10:48:50,833 INFO L226 Difference]: Without dead ends: 1250 [2025-03-03 10:48:50,834 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-03 10:48:50,835 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 419 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:50,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 121 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:48:50,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-03-03 10:48:50,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2025-03-03 10:48:50,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.2361889511609288) internal successors, (1544), 1249 states have internal predecessors, (1544), 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-03 10:48:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1544 transitions. [2025-03-03 10:48:50,868 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1544 transitions. Word has length 128 [2025-03-03 10:48:50,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:50,868 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1544 transitions. [2025-03-03 10:48:50,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 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-03 10:48:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1544 transitions. [2025-03-03 10:48:50,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 10:48:50,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:50,871 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, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:48:50,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:48:50,871 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:50,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:50,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1521685670, now seen corresponding path program 1 times [2025-03-03 10:48:50,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:50,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736504589] [2025-03-03 10:48:50,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:50,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:50,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 10:48:50,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 10:48:50,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:50,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 10:48:51,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:51,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736504589] [2025-03-03 10:48:51,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736504589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:51,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:48:51,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:48:51,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195940413] [2025-03-03 10:48:51,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:51,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:48:51,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:51,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:48:51,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:48:51,133 INFO L87 Difference]: Start difference. First operand 1250 states and 1544 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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-03 10:48:51,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:51,709 INFO L93 Difference]: Finished difference Result 2705 states and 3353 transitions. [2025-03-03 10:48:51,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:48:51,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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 208 [2025-03-03 10:48:51,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:51,715 INFO L225 Difference]: With dead ends: 2705 [2025-03-03 10:48:51,715 INFO L226 Difference]: Without dead ends: 1606 [2025-03-03 10:48:51,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:48:51,718 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 116 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:51,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 119 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:48:51,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-03-03 10:48:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2025-03-03 10:48:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.1221183800623054) internal successors, (1801), 1605 states have internal predecessors, (1801), 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-03 10:48:51,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1801 transitions. [2025-03-03 10:48:51,745 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1801 transitions. Word has length 208 [2025-03-03 10:48:51,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:51,746 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1801 transitions. [2025-03-03 10:48:51,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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-03 10:48:51,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1801 transitions. [2025-03-03 10:48:51,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-03-03 10:48:51,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:51,751 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:48:51,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:48:51,751 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:51,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:51,752 INFO L85 PathProgramCache]: Analyzing trace with hash 670736913, now seen corresponding path program 1 times [2025-03-03 10:48:51,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:51,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955131358] [2025-03-03 10:48:51,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:51,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:51,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-03 10:48:51,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-03 10:48:51,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:51,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:52,165 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 188 proven. 130 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-03 10:48:52,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:52,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955131358] [2025-03-03 10:48:52,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955131358] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:48:52,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118322512] [2025-03-03 10:48:52,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:52,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:52,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:48:52,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:48:52,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:48:52,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-03 10:48:52,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-03 10:48:52,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:52,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:52,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:48:52,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:48:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-03 10:48:52,433 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:48:52,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118322512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:52,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:48:52,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:48:52,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106206772] [2025-03-03 10:48:52,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:52,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:48:52,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:52,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:48:52,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:48:52,436 INFO L87 Difference]: Start difference. First operand 1606 states and 1801 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:48:52,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:52,966 INFO L93 Difference]: Finished difference Result 3388 states and 3901 transitions. [2025-03-03 10:48:52,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:48:52,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 335 [2025-03-03 10:48:52,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:52,971 INFO L225 Difference]: With dead ends: 3388 [2025-03-03 10:48:52,972 INFO L226 Difference]: Without dead ends: 1962 [2025-03-03 10:48:52,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:48:52,973 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 136 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:52,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 254 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:48:52,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-03-03 10:48:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2025-03-03 10:48:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 1.1320754716981132) internal successors, (2220), 1961 states have internal predecessors, (2220), 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-03 10:48:53,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2220 transitions. [2025-03-03 10:48:53,003 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2220 transitions. Word has length 335 [2025-03-03 10:48:53,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:53,003 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2220 transitions. [2025-03-03 10:48:53,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:48:53,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2220 transitions. [2025-03-03 10:48:53,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-03 10:48:53,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:53,006 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 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] [2025-03-03 10:48:53,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 10:48:53,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:53,211 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:53,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:53,212 INFO L85 PathProgramCache]: Analyzing trace with hash -454462693, now seen corresponding path program 1 times [2025-03-03 10:48:53,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:53,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508246230] [2025-03-03 10:48:53,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:53,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:53,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-03 10:48:53,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-03 10:48:53,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:53,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 271 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:48:53,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:53,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508246230] [2025-03-03 10:48:53,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508246230] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:48:53,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209066421] [2025-03-03 10:48:53,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:53,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:53,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:48:53,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:48:53,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:48:53,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-03 10:48:53,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-03 10:48:53,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:53,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:53,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:48:53,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:48:53,904 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-03-03 10:48:53,904 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:48:53,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209066421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:53,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:48:53,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:48:53,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471892628] [2025-03-03 10:48:53,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:53,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:48:53,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:53,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:48:53,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:48:53,906 INFO L87 Difference]: Start difference. First operand 1962 states and 2220 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:48:54,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:54,338 INFO L93 Difference]: Finished difference Result 4278 states and 4949 transitions. [2025-03-03 10:48:54,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:48:54,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 339 [2025-03-03 10:48:54,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:54,345 INFO L225 Difference]: With dead ends: 4278 [2025-03-03 10:48:54,345 INFO L226 Difference]: Without dead ends: 2318 [2025-03-03 10:48:54,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:48:54,348 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 132 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:54,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 265 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:48:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2025-03-03 10:48:54,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 1606. [2025-03-03 10:48:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.1246105919003115) internal successors, (1805), 1605 states have internal predecessors, (1805), 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-03 10:48:54,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1805 transitions. [2025-03-03 10:48:54,378 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1805 transitions. Word has length 339 [2025-03-03 10:48:54,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:54,378 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1805 transitions. [2025-03-03 10:48:54,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:48:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1805 transitions. [2025-03-03 10:48:54,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-03 10:48:54,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:54,382 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:48:54,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 10:48:54,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 10:48:54,583 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:54,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:54,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1660302343, now seen corresponding path program 1 times [2025-03-03 10:48:54,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:54,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227692095] [2025-03-03 10:48:54,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:54,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:54,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-03 10:48:54,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-03 10:48:54,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:54,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 195 proven. 130 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 10:48:54,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:54,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227692095] [2025-03-03 10:48:54,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227692095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:48:54,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164545926] [2025-03-03 10:48:54,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:54,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:54,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:48:54,932 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:48:54,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:48:54,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-03 10:48:55,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-03 10:48:55,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:55,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:55,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:48:55,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:48:55,339 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2025-03-03 10:48:55,340 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:48:55,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164545926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:55,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:48:55,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-03 10:48:55,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006908521] [2025-03-03 10:48:55,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:55,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:48:55,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:55,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:48:55,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:48:55,341 INFO L87 Difference]: Start difference. First operand 1606 states and 1805 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:48:55,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:55,782 INFO L93 Difference]: Finished difference Result 3388 states and 3919 transitions. [2025-03-03 10:48:55,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:48:55,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 342 [2025-03-03 10:48:55,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:55,788 INFO L225 Difference]: With dead ends: 3388 [2025-03-03 10:48:55,788 INFO L226 Difference]: Without dead ends: 2140 [2025-03-03 10:48:55,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:48:55,790 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:55,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 47 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:48:55,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-03-03 10:48:55,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140. [2025-03-03 10:48:55,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.1117344553529687) internal successors, (2378), 2139 states have internal predecessors, (2378), 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-03 10:48:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2378 transitions. [2025-03-03 10:48:55,821 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2378 transitions. Word has length 342 [2025-03-03 10:48:55,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:55,822 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2378 transitions. [2025-03-03 10:48:55,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:48:55,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2378 transitions. [2025-03-03 10:48:55,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-03 10:48:55,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:55,825 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-03 10:48:55,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 10:48:56,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:56,030 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:56,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:56,030 INFO L85 PathProgramCache]: Analyzing trace with hash 165133507, now seen corresponding path program 1 times [2025-03-03 10:48:56,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:56,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481161494] [2025-03-03 10:48:56,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:56,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:56,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-03 10:48:56,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-03 10:48:56,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:56,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:48:56,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:56,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481161494] [2025-03-03 10:48:56,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481161494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:56,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:48:56,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:48:56,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000081942] [2025-03-03 10:48:56,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:56,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:48:56,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:56,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:48:56,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:48:56,192 INFO L87 Difference]: Start difference. First operand 2140 states and 2378 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:48:56,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:56,609 INFO L93 Difference]: Finished difference Result 4456 states and 5046 transitions. [2025-03-03 10:48:56,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:48:56,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 366 [2025-03-03 10:48:56,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:56,617 INFO L225 Difference]: With dead ends: 4456 [2025-03-03 10:48:56,617 INFO L226 Difference]: Without dead ends: 2674 [2025-03-03 10:48:56,619 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-03 10:48:56,619 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 138 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:56,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 78 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:48:56,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2025-03-03 10:48:56,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2496. [2025-03-03 10:48:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2495 states have (on average 1.1170340681362725) internal successors, (2787), 2495 states have internal predecessors, (2787), 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-03 10:48:56,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2787 transitions. [2025-03-03 10:48:56,654 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2787 transitions. Word has length 366 [2025-03-03 10:48:56,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:56,654 INFO L471 AbstractCegarLoop]: Abstraction has 2496 states and 2787 transitions. [2025-03-03 10:48:56,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:48:56,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2787 transitions. [2025-03-03 10:48:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-03 10:48:56,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:56,657 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:48:56,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:48:56,658 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:56,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:56,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1726721520, now seen corresponding path program 1 times [2025-03-03 10:48:56,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:56,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120333727] [2025-03-03 10:48:56,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:56,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:56,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-03 10:48:56,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-03 10:48:56,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:56,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:48:56,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:56,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120333727] [2025-03-03 10:48:56,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120333727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:56,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:48:56,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:48:56,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153822229] [2025-03-03 10:48:56,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:56,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:48:56,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:56,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:48:56,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:48:56,796 INFO L87 Difference]: Start difference. First operand 2496 states and 2787 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-03 10:48:57,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:57,208 INFO L93 Difference]: Finished difference Result 3388 states and 3849 transitions. [2025-03-03 10:48:57,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:48:57,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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 373 [2025-03-03 10:48:57,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:57,218 INFO L225 Difference]: With dead ends: 3388 [2025-03-03 10:48:57,218 INFO L226 Difference]: Without dead ends: 3386 [2025-03-03 10:48:57,219 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-03 10:48:57,219 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 136 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:57,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 18 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:48:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2025-03-03 10:48:57,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 2852. [2025-03-03 10:48:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2851 states have (on average 1.1410031567870922) internal successors, (3253), 2851 states have internal predecessors, (3253), 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-03 10:48:57,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3253 transitions. [2025-03-03 10:48:57,260 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3253 transitions. Word has length 373 [2025-03-03 10:48:57,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:57,260 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 3253 transitions. [2025-03-03 10:48:57,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-03 10:48:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3253 transitions. [2025-03-03 10:48:57,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-03-03 10:48:57,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:57,264 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:48:57,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:48:57,264 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:57,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:57,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1176207595, now seen corresponding path program 1 times [2025-03-03 10:48:57,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:57,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044678249] [2025-03-03 10:48:57,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:57,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:57,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-03-03 10:48:57,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-03-03 10:48:57,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:57,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:57,526 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 595 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-03 10:48:57,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:57,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044678249] [2025-03-03 10:48:57,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044678249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:57,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:48:57,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:48:57,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877488994] [2025-03-03 10:48:57,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:57,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:48:57,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:57,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:48:57,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:48:57,529 INFO L87 Difference]: Start difference. First operand 2852 states and 3253 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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-03 10:48:57,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:57,927 INFO L93 Difference]: Finished difference Result 5880 states and 6731 transitions. [2025-03-03 10:48:57,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:48:57,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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 450 [2025-03-03 10:48:57,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:57,935 INFO L225 Difference]: With dead ends: 5880 [2025-03-03 10:48:57,935 INFO L226 Difference]: Without dead ends: 3208 [2025-03-03 10:48:57,938 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-03 10:48:57,939 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 72 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:57,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 76 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:48:57,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2025-03-03 10:48:57,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3208. [2025-03-03 10:48:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3208 states, 3207 states have (on average 1.1303398815091987) internal successors, (3625), 3207 states have internal predecessors, (3625), 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-03 10:48:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3625 transitions. [2025-03-03 10:48:57,996 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3625 transitions. Word has length 450 [2025-03-03 10:48:57,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:57,998 INFO L471 AbstractCegarLoop]: Abstraction has 3208 states and 3625 transitions. [2025-03-03 10:48:57,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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-03 10:48:57,998 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3625 transitions. [2025-03-03 10:48:58,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-03-03 10:48:58,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:58,001 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:48:58,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:48:58,002 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:58,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:58,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1164069376, now seen corresponding path program 1 times [2025-03-03 10:48:58,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:58,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748504634] [2025-03-03 10:48:58,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:58,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:58,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-03-03 10:48:58,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-03-03 10:48:58,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:58,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:58,123 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-03 10:48:58,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:58,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748504634] [2025-03-03 10:48:58,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748504634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:58,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:48:58,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:48:58,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248727974] [2025-03-03 10:48:58,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:58,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:48:58,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:58,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:48:58,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:48:58,125 INFO L87 Difference]: Start difference. First operand 3208 states and 3625 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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-03 10:48:58,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:58,552 INFO L93 Difference]: Finished difference Result 6948 states and 7940 transitions. [2025-03-03 10:48:58,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:48:58,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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 450 [2025-03-03 10:48:58,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:58,582 INFO L225 Difference]: With dead ends: 6948 [2025-03-03 10:48:58,582 INFO L226 Difference]: Without dead ends: 4098 [2025-03-03 10:48:58,584 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-03 10:48:58,585 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 114 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:58,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 57 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:48:58,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2025-03-03 10:48:58,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3564. [2025-03-03 10:48:58,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3564 states, 3563 states have (on average 1.1164748807184957) internal successors, (3978), 3563 states have internal predecessors, (3978), 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-03 10:48:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3978 transitions. [2025-03-03 10:48:58,639 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3978 transitions. Word has length 450 [2025-03-03 10:48:58,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:58,640 INFO L471 AbstractCegarLoop]: Abstraction has 3564 states and 3978 transitions. [2025-03-03 10:48:58,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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-03 10:48:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3978 transitions. [2025-03-03 10:48:58,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-03-03 10:48:58,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:58,646 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, 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:48:58,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:48:58,646 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:58,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:58,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1659976675, now seen corresponding path program 1 times [2025-03-03 10:48:58,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:58,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832989042] [2025-03-03 10:48:58,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:58,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:58,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-03 10:48:58,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-03 10:48:58,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:58,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-03 10:48:58,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:58,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832989042] [2025-03-03 10:48:58,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832989042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:58,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:48:58,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:48:58,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966851477] [2025-03-03 10:48:58,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:58,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:48:58,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:58,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:48:58,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:48:58,929 INFO L87 Difference]: Start difference. First operand 3564 states and 3978 transitions. Second operand has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 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-03 10:48:59,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:59,389 INFO L93 Difference]: Finished difference Result 6977 states and 7807 transitions. [2025-03-03 10:48:59,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:48:59,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 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 530 [2025-03-03 10:48:59,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:59,397 INFO L225 Difference]: With dead ends: 6977 [2025-03-03 10:48:59,397 INFO L226 Difference]: Without dead ends: 3742 [2025-03-03 10:48:59,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:48:59,401 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 140 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:59,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 17 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:48:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2025-03-03 10:48:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3564. [2025-03-03 10:48:59,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3564 states, 3563 states have (on average 1.0791467864159416) internal successors, (3845), 3563 states have internal predecessors, (3845), 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-03 10:48:59,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3845 transitions. [2025-03-03 10:48:59,440 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3845 transitions. Word has length 530 [2025-03-03 10:48:59,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:59,440 INFO L471 AbstractCegarLoop]: Abstraction has 3564 states and 3845 transitions. [2025-03-03 10:48:59,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 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-03 10:48:59,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3845 transitions. [2025-03-03 10:48:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2025-03-03 10:48:59,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:59,444 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:48:59,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:48:59,444 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:59,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:59,445 INFO L85 PathProgramCache]: Analyzing trace with hash 745826942, now seen corresponding path program 2 times [2025-03-03 10:48:59,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:59,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993678803] [2025-03-03 10:48:59,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 10:48:59,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:59,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 556 statements into 2 equivalence classes. [2025-03-03 10:48:59,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 556 of 556 statements. [2025-03-03 10:48:59,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 10:48:59,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:59,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 819 proven. 11 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-03 10:48:59,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:59,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993678803] [2025-03-03 10:48:59,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993678803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:48:59,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158863838] [2025-03-03 10:48:59,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 10:48:59,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:59,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:48:59,781 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:48:59,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 10:48:59,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 556 statements into 2 equivalence classes. [2025-03-03 10:48:59,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 556 of 556 statements. [2025-03-03 10:48:59,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 10:48:59,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:59,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:48:59,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:49:00,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 830 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-03 10:49:00,746 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:49:00,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158863838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:00,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:49:00,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-03 10:49:00,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862385287] [2025-03-03 10:49:00,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:00,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:49:00,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:00,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:49:00,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:49:00,748 INFO L87 Difference]: Start difference. First operand 3564 states and 3845 transitions. Second operand has 5 states, 5 states have (on average 60.4) internal successors, (302), 4 states have internal predecessors, (302), 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-03 10:49:01,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:01,317 INFO L93 Difference]: Finished difference Result 7155 states and 7724 transitions. [2025-03-03 10:49:01,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:49:01,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 4 states have internal predecessors, (302), 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 556 [2025-03-03 10:49:01,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:01,326 INFO L225 Difference]: With dead ends: 7155 [2025-03-03 10:49:01,326 INFO L226 Difference]: Without dead ends: 3742 [2025-03-03 10:49:01,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 553 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:49:01,329 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 298 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:01,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 20 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:49:01,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2025-03-03 10:49:01,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3386. [2025-03-03 10:49:01,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.0765140324963072) internal successors, (3644), 3385 states have internal predecessors, (3644), 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-03 10:49:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3644 transitions. [2025-03-03 10:49:01,362 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3644 transitions. Word has length 556 [2025-03-03 10:49:01,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:01,363 INFO L471 AbstractCegarLoop]: Abstraction has 3386 states and 3644 transitions. [2025-03-03 10:49:01,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 4 states have internal predecessors, (302), 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-03 10:49:01,363 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3644 transitions. [2025-03-03 10:49:01,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-03-03 10:49:01,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:01,367 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:01,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 10:49:01,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:01,568 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:01,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:01,568 INFO L85 PathProgramCache]: Analyzing trace with hash 659491563, now seen corresponding path program 1 times [2025-03-03 10:49:01,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:01,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802649401] [2025-03-03 10:49:01,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:01,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:01,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-03-03 10:49:01,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-03-03 10:49:01,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:01,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 832 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-03 10:49:01,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:01,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802649401] [2025-03-03 10:49:01,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802649401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:01,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:01,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:01,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438582022] [2025-03-03 10:49:01,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:01,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:01,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:01,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:01,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:01,897 INFO L87 Difference]: Start difference. First operand 3386 states and 3644 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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-03 10:49:02,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:02,208 INFO L93 Difference]: Finished difference Result 7304 states and 7907 transitions. [2025-03-03 10:49:02,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:02,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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 563 [2025-03-03 10:49:02,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:02,222 INFO L225 Difference]: With dead ends: 7304 [2025-03-03 10:49:02,224 INFO L226 Difference]: Without dead ends: 4098 [2025-03-03 10:49:02,228 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-03 10:49:02,228 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 74 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:02,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 230 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:49:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2025-03-03 10:49:02,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 4098. [2025-03-03 10:49:02,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.069319013912619) internal successors, (4381), 4097 states have internal predecessors, (4381), 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-03 10:49:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4381 transitions. [2025-03-03 10:49:02,260 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4381 transitions. Word has length 563 [2025-03-03 10:49:02,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:02,260 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 4381 transitions. [2025-03-03 10:49:02,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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-03 10:49:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4381 transitions. [2025-03-03 10:49:02,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-03-03 10:49:02,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:02,266 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:02,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:49:02,266 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:02,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:02,267 INFO L85 PathProgramCache]: Analyzing trace with hash 464347336, now seen corresponding path program 1 times [2025-03-03 10:49:02,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:02,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055301052] [2025-03-03 10:49:02,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:02,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:02,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-03 10:49:02,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-03 10:49:02,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:02,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1629 backedges. 1268 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-03 10:49:02,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:02,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055301052] [2025-03-03 10:49:02,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055301052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:02,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:02,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 10:49:02,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360447909] [2025-03-03 10:49:02,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:02,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 10:49:02,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:02,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 10:49:02,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:49:02,722 INFO L87 Difference]: Start difference. First operand 4098 states and 4381 transitions. Second operand has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 5 states have internal predecessors, (404), 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-03 10:49:03,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:03,568 INFO L93 Difference]: Finished difference Result 8550 states and 9170 transitions. [2025-03-03 10:49:03,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 10:49:03,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 5 states have internal predecessors, (404), 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 658 [2025-03-03 10:49:03,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:03,576 INFO L225 Difference]: With dead ends: 8550 [2025-03-03 10:49:03,576 INFO L226 Difference]: Without dead ends: 4810 [2025-03-03 10:49:03,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:49:03,579 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 285 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1829 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:03,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 68 Invalid, 1863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1829 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:49:03,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2025-03-03 10:49:03,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4632. [2025-03-03 10:49:03,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4631 states have (on average 1.0649967609587563) internal successors, (4932), 4631 states have internal predecessors, (4932), 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-03 10:49:03,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4932 transitions. [2025-03-03 10:49:03,613 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4932 transitions. Word has length 658 [2025-03-03 10:49:03,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:03,613 INFO L471 AbstractCegarLoop]: Abstraction has 4632 states and 4932 transitions. [2025-03-03 10:49:03,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 5 states have internal predecessors, (404), 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-03 10:49:03,614 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4932 transitions. [2025-03-03 10:49:03,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-03-03 10:49:03,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:03,619 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:03,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:49:03,620 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:03,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:03,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1827205167, now seen corresponding path program 1 times [2025-03-03 10:49:03,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:03,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485999225] [2025-03-03 10:49:03,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:03,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:03,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-03-03 10:49:03,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-03-03 10:49:03,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:03,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:03,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1805 backedges. 1289 proven. 155 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-03 10:49:03,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:03,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485999225] [2025-03-03 10:49:03,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485999225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:03,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608150451] [2025-03-03 10:49:03,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:03,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:03,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:49:03,951 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:49:03,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 10:49:04,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-03-03 10:49:04,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-03-03 10:49:04,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:04,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:04,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:49:04,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:49:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1805 backedges. 1289 proven. 155 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-03 10:49:04,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:49:04,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1805 backedges. 1289 proven. 155 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-03 10:49:04,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608150451] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:49:04,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:49:04,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 10:49:04,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72149885] [2025-03-03 10:49:04,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:49:04,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 10:49:04,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:04,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 10:49:04,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:49:04,652 INFO L87 Difference]: Start difference. First operand 4632 states and 4932 transitions. Second operand has 6 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 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-03 10:49:05,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:05,277 INFO L93 Difference]: Finished difference Result 9974 states and 10650 transitions. [2025-03-03 10:49:05,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:49:05,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 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 785 [2025-03-03 10:49:05,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:05,285 INFO L225 Difference]: With dead ends: 9974 [2025-03-03 10:49:05,285 INFO L226 Difference]: Without dead ends: 5700 [2025-03-03 10:49:05,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1572 GetRequests, 1568 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:49:05,289 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 44 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:05,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 55 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:49:05,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2025-03-03 10:49:05,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 4988. [2025-03-03 10:49:05,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4988 states, 4987 states have (on average 1.0659715259675155) internal successors, (5316), 4987 states have internal predecessors, (5316), 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-03 10:49:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5316 transitions. [2025-03-03 10:49:05,325 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5316 transitions. Word has length 785 [2025-03-03 10:49:05,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:05,326 INFO L471 AbstractCegarLoop]: Abstraction has 4988 states and 5316 transitions. [2025-03-03 10:49:05,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 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-03 10:49:05,326 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5316 transitions. [2025-03-03 10:49:05,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-03-03 10:49:05,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:05,332 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, 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, 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, 4, 3, 3, 3, 3, 3, 3, 3, 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-03 10:49:05,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 10:49:05,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 10:49:05,532 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:05,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:05,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1974623681, now seen corresponding path program 1 times [2025-03-03 10:49:05,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:05,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243340316] [2025-03-03 10:49:05,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:05,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:05,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-03-03 10:49:05,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-03-03 10:49:05,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:05,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:05,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2236 backedges. 1423 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2025-03-03 10:49:05,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:05,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243340316] [2025-03-03 10:49:05,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243340316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:05,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:05,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:05,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101901702] [2025-03-03 10:49:05,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:05,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:05,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:05,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:05,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:05,975 INFO L87 Difference]: Start difference. First operand 4988 states and 5316 transitions. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-03 10:49:06,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:06,325 INFO L93 Difference]: Finished difference Result 10330 states and 11063 transitions. [2025-03-03 10:49:06,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:06,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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 805 [2025-03-03 10:49:06,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:06,332 INFO L225 Difference]: With dead ends: 10330 [2025-03-03 10:49:06,332 INFO L226 Difference]: Without dead ends: 5522 [2025-03-03 10:49:06,336 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-03 10:49:06,337 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:06,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 222 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:49:06,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2025-03-03 10:49:06,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 5166. [2025-03-03 10:49:06,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5166 states, 5165 states have (on average 1.049757986447241) internal successors, (5422), 5165 states have internal predecessors, (5422), 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-03 10:49:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5422 transitions. [2025-03-03 10:49:06,381 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5422 transitions. Word has length 805 [2025-03-03 10:49:06,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:06,382 INFO L471 AbstractCegarLoop]: Abstraction has 5166 states and 5422 transitions. [2025-03-03 10:49:06,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-03 10:49:06,382 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5422 transitions. [2025-03-03 10:49:06,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 953 [2025-03-03 10:49:06,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:06,400 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:06,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:49:06,401 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:06,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:06,401 INFO L85 PathProgramCache]: Analyzing trace with hash 2077154494, now seen corresponding path program 1 times [2025-03-03 10:49:06,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:06,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691944807] [2025-03-03 10:49:06,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:06,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:06,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 952 statements into 1 equivalence classes. [2025-03-03 10:49:06,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 952 of 952 statements. [2025-03-03 10:49:06,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:06,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:07,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 1865 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-03-03 10:49:07,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:07,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691944807] [2025-03-03 10:49:07,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691944807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:07,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192426739] [2025-03-03 10:49:07,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:07,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:07,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:49:07,212 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:49:07,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 10:49:07,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 952 statements into 1 equivalence classes. [2025-03-03 10:49:07,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 952 of 952 statements. [2025-03-03 10:49:07,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:07,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:07,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 10:49:07,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:49:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 1865 proven. 625 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2025-03-03 10:49:07,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:49:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 1937 proven. 0 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-03-03 10:49:08,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192426739] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:08,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:49:08,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2025-03-03 10:49:08,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204328056] [2025-03-03 10:49:08,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:08,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:49:08,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:08,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:49:08,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:49:08,384 INFO L87 Difference]: Start difference. First operand 5166 states and 5422 transitions. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 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-03 10:49:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:08,743 INFO L93 Difference]: Finished difference Result 10152 states and 10666 transitions. [2025-03-03 10:49:08,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:49:08,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 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 952 [2025-03-03 10:49:08,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:08,750 INFO L225 Difference]: With dead ends: 10152 [2025-03-03 10:49:08,750 INFO L226 Difference]: Without dead ends: 5344 [2025-03-03 10:49:08,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1907 GetRequests, 1899 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:49:08,753 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 143 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:08,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 9 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:49:08,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2025-03-03 10:49:08,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 4810. [2025-03-03 10:49:08,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4809 states have (on average 1.0467872738615096) internal successors, (5034), 4809 states have internal predecessors, (5034), 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-03 10:49:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5034 transitions. [2025-03-03 10:49:08,787 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5034 transitions. Word has length 952 [2025-03-03 10:49:08,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:08,787 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 5034 transitions. [2025-03-03 10:49:08,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 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-03 10:49:08,788 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5034 transitions. [2025-03-03 10:49:08,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 975 [2025-03-03 10:49:08,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:08,793 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:49:08,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 10:49:08,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 10:49:08,995 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:08,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:08,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1753427183, now seen corresponding path program 1 times [2025-03-03 10:49:08,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:08,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104148298] [2025-03-03 10:49:08,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:08,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:09,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 974 statements into 1 equivalence classes. [2025-03-03 10:49:09,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 974 of 974 statements. [2025-03-03 10:49:09,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:09,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:09,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3038 backedges. 1500 proven. 0 refuted. 0 times theorem prover too weak. 1538 trivial. 0 not checked. [2025-03-03 10:49:09,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:09,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104148298] [2025-03-03 10:49:09,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104148298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:09,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:09,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 10:49:09,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570654688] [2025-03-03 10:49:09,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:09,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 10:49:09,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:09,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 10:49:09,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:49:09,625 INFO L87 Difference]: Start difference. First operand 4810 states and 5034 transitions. Second operand has 7 states, 7 states have (on average 50.714285714285715) internal successors, (355), 6 states have internal predecessors, (355), 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-03 10:49:10,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:10,038 INFO L93 Difference]: Finished difference Result 9490 states and 9940 transitions. [2025-03-03 10:49:10,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 10:49:10,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 50.714285714285715) internal successors, (355), 6 states have internal predecessors, (355), 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 974 [2025-03-03 10:49:10,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:10,044 INFO L225 Difference]: With dead ends: 9490 [2025-03-03 10:49:10,045 INFO L226 Difference]: Without dead ends: 4988 [2025-03-03 10:49:10,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:49:10,048 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 43 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:10,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 23 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:49:10,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2025-03-03 10:49:10,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4810. [2025-03-03 10:49:10,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4809 states have (on average 1.0359742150135163) internal successors, (4982), 4809 states have internal predecessors, (4982), 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-03 10:49:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4982 transitions. [2025-03-03 10:49:10,084 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4982 transitions. Word has length 974 [2025-03-03 10:49:10,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:10,084 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 4982 transitions. [2025-03-03 10:49:10,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.714285714285715) internal successors, (355), 6 states have internal predecessors, (355), 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-03 10:49:10,085 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4982 transitions. [2025-03-03 10:49:10,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1076 [2025-03-03 10:49:10,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:10,092 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 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, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:10,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 10:49:10,092 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:10,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:10,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1149734431, now seen corresponding path program 1 times [2025-03-03 10:49:10,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:10,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282164494] [2025-03-03 10:49:10,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:10,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:10,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1075 statements into 1 equivalence classes. [2025-03-03 10:49:10,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1075 of 1075 statements. [2025-03-03 10:49:10,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:10,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3728 backedges. 2665 proven. 72 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2025-03-03 10:49:10,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:10,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282164494] [2025-03-03 10:49:10,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282164494] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:10,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175999836] [2025-03-03 10:49:10,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:10,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:10,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:49:10,966 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:49:10,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 10:49:11,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1075 statements into 1 equivalence classes. [2025-03-03 10:49:11,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1075 of 1075 statements. [2025-03-03 10:49:11,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:11,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:11,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 1321 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:49:11,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:49:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3728 backedges. 1062 proven. 0 refuted. 0 times theorem prover too weak. 2666 trivial. 0 not checked. [2025-03-03 10:49:11,260 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:49:11,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175999836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:11,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:49:11,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 10:49:11,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837863687] [2025-03-03 10:49:11,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:11,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:11,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:11,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:11,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:49:11,262 INFO L87 Difference]: Start difference. First operand 4810 states and 4982 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-03 10:49:11,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:11,551 INFO L93 Difference]: Finished difference Result 9440 states and 9786 transitions. [2025-03-03 10:49:11,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:11,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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 1075 [2025-03-03 10:49:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:11,558 INFO L225 Difference]: With dead ends: 9440 [2025-03-03 10:49:11,558 INFO L226 Difference]: Without dead ends: 4988 [2025-03-03 10:49:11,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1079 GetRequests, 1075 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:49:11,562 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 97 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:11,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 224 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:49:11,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2025-03-03 10:49:11,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4810. [2025-03-03 10:49:11,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4809 states have (on average 1.0345186109378248) internal successors, (4975), 4809 states have internal predecessors, (4975), 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-03 10:49:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4975 transitions. [2025-03-03 10:49:11,598 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4975 transitions. Word has length 1075 [2025-03-03 10:49:11,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:11,599 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 4975 transitions. [2025-03-03 10:49:11,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-03 10:49:11,599 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4975 transitions. [2025-03-03 10:49:11,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1179 [2025-03-03 10:49:11,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:11,608 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:49:11,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 10:49:11,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:11,809 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:11,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:11,810 INFO L85 PathProgramCache]: Analyzing trace with hash -434678189, now seen corresponding path program 1 times [2025-03-03 10:49:11,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:11,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681719361] [2025-03-03 10:49:11,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:11,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:11,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1178 statements into 1 equivalence classes. [2025-03-03 10:49:11,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1178 of 1178 statements. [2025-03-03 10:49:11,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:11,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4611 backedges. 1883 proven. 0 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked. [2025-03-03 10:49:12,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:12,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681719361] [2025-03-03 10:49:12,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681719361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:12,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:12,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:12,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66568213] [2025-03-03 10:49:12,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:12,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:49:12,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:12,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:49:12,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:49:12,507 INFO L87 Difference]: Start difference. First operand 4810 states and 4975 transitions. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 3 states have internal predecessors, (335), 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-03 10:49:12,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:12,873 INFO L93 Difference]: Finished difference Result 9462 states and 9794 transitions. [2025-03-03 10:49:12,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:49:12,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 3 states have internal predecessors, (335), 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 1178 [2025-03-03 10:49:12,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:12,879 INFO L225 Difference]: With dead ends: 9462 [2025-03-03 10:49:12,880 INFO L226 Difference]: Without dead ends: 4988 [2025-03-03 10:49:12,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:49:12,884 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:12,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 17 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:49:12,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2025-03-03 10:49:12,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4810. [2025-03-03 10:49:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4809 states have (on average 1.0343106674984404) internal successors, (4974), 4809 states have internal predecessors, (4974), 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-03 10:49:12,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4974 transitions. [2025-03-03 10:49:12,922 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4974 transitions. Word has length 1178 [2025-03-03 10:49:12,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:12,922 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 4974 transitions. [2025-03-03 10:49:12,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 3 states have internal predecessors, (335), 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-03 10:49:12,922 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4974 transitions. [2025-03-03 10:49:12,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1197 [2025-03-03 10:49:12,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:12,932 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 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, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:12,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 10:49:12,932 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:12,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:12,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1089892647, now seen corresponding path program 1 times [2025-03-03 10:49:12,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:12,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526619809] [2025-03-03 10:49:12,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:12,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:12,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1196 statements into 1 equivalence classes. [2025-03-03 10:49:13,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1196 of 1196 statements. [2025-03-03 10:49:13,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:13,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:14,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 3500 proven. 72 refuted. 0 times theorem prover too weak. 1120 trivial. 0 not checked. [2025-03-03 10:49:14,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:14,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526619809] [2025-03-03 10:49:14,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526619809] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:14,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253424146] [2025-03-03 10:49:14,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:14,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:14,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:49:14,031 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:49:14,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 10:49:14,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1196 statements into 1 equivalence classes. [2025-03-03 10:49:14,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1196 of 1196 statements. [2025-03-03 10:49:14,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:14,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:14,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 10:49:14,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:49:14,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 3459 proven. 666 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2025-03-03 10:49:14,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:49:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 3572 proven. 0 refuted. 0 times theorem prover too weak. 1120 trivial. 0 not checked. [2025-03-03 10:49:15,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253424146] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:15,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:49:15,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2025-03-03 10:49:15,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634337244] [2025-03-03 10:49:15,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:15,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:49:15,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:15,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:49:15,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:49:15,079 INFO L87 Difference]: Start difference. First operand 4810 states and 4974 transitions. Second operand has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 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-03 10:49:15,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:15,390 INFO L93 Difference]: Finished difference Result 9794 states and 10136 transitions. [2025-03-03 10:49:15,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:49:15,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 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 1196 [2025-03-03 10:49:15,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:15,391 INFO L225 Difference]: With dead ends: 9794 [2025-03-03 10:49:15,391 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:49:15,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2395 GetRequests, 2388 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:49:15,396 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 88 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:15,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 8 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:49:15,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:49:15,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:49:15,397 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-03 10:49:15,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:49:15,397 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1196 [2025-03-03 10:49:15,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:15,397 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:49:15,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 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-03 10:49:15,398 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:49:15,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:49:15,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:49:15,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 10:49:15,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-03 10:49:15,602 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:15,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:49:18,268 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:49:18,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:49:18 BoogieIcfgContainer [2025-03-03 10:49:18,298 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:49:18,298 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:49:18,298 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:49:18,298 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:49:18,299 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:48:47" (3/4) ... [2025-03-03 10:49:18,301 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:49:18,343 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 10:49:18,349 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:49:18,350 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:49:18,350 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:49:18,493 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:49:18,493 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:49:18,493 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:49:18,494 INFO L158 Benchmark]: Toolchain (without parser) took 32435.94ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 131.1MB in the beginning and 119.4MB in the end (delta: 11.7MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2025-03-03 10:49:18,494 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 226.5MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:49:18,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.37ms. Allocated memory is still 167.8MB. Free memory was 131.1MB in the beginning and 99.5MB in the end (delta: 31.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 10:49:18,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.42ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 90.4MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:49:18,494 INFO L158 Benchmark]: Boogie Preprocessor took 98.67ms. Allocated memory is still 167.8MB. Free memory was 90.4MB in the beginning and 79.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:49:18,495 INFO L158 Benchmark]: IcfgBuilder took 1118.33ms. Allocated memory is still 167.8MB. Free memory was 79.2MB in the beginning and 115.8MB in the end (delta: -36.6MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2025-03-03 10:49:18,495 INFO L158 Benchmark]: TraceAbstraction took 30447.14ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 115.8MB in the beginning and 131.8MB in the end (delta: -16.0MB). Peak memory consumption was 670.8MB. Max. memory is 16.1GB. [2025-03-03 10:49:18,495 INFO L158 Benchmark]: Witness Printer took 195.05ms. Allocated memory is still 201.3MB. Free memory was 131.8MB in the beginning and 119.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:49:18,496 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 226.5MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.37ms. Allocated memory is still 167.8MB. Free memory was 131.1MB in the beginning and 99.5MB in the end (delta: 31.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.42ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 90.4MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.67ms. Allocated memory is still 167.8MB. Free memory was 90.4MB in the beginning and 79.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1118.33ms. Allocated memory is still 167.8MB. Free memory was 79.2MB in the beginning and 115.8MB in the end (delta: -36.6MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. * TraceAbstraction took 30447.14ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 115.8MB in the beginning and 131.8MB in the end (delta: -16.0MB). Peak memory consumption was 670.8MB. Max. memory is 16.1GB. * Witness Printer took 195.05ms. Allocated memory is still 201.3MB. Free memory was 131.8MB in the beginning and 119.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 161]: 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, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.7s, OverallIterations: 22, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2984 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2984 mSDsluCounter, 2117 SdHoareTripleChecker+Invalid, 8.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 1468 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13523 IncrementalHoareTripleChecker+Invalid, 14991 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1468 mSolverCounterUnsat, 1956 mSDtfsCounter, 13523 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8585 GetRequests, 8516 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5166occurred in iteration=17, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 4806 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 18016 NumberOfCodeBlocks, 18016 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 20916 ConstructedInterpolants, 0 QuantifiedInterpolants, 56736 SizeOfPredicates, 0 NumberOfNonLiveVariables, 7000 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 33 InterpolantComputations, 21 PerfectInterpolantSequences, 54468/56841 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: 890]: Location Invariant Derived location invariant: (((((((((((a24 == 1) && (81 <= a12)) && (a12 <= 600060)) || ((a21 == 8) && (a15 <= 6))) || ((a21 == 9) && (a15 <= 6))) || ((a15 <= 6) && (a12 <= 600060))) || ((((a12 <= 80) && (a24 == 1)) && (a15 <= 8)) && (a21 == 9))) || ((((a24 == 1) && (5 == a15)) && (a21 == 6)) && (a12 <= 600129))) || (((a21 == 8) && (a24 == 1)) && (a12 <= 600060))) || ((7 == a21) && (a15 <= 6))) || ((a12 <= 11) && (a24 == 1))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:49:18,508 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