./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label02.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c0f41b7d074691792fd10e7dba36f11652ac022c2313237070654cd8c5fa3312 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:52:13,675 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:52:13,710 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:52:13,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:52:13,713 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:52:13,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:52:13,727 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:52:13,727 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:52:13,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:52:13,727 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:52:13,727 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:52:13,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:52:13,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:52:13,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:52:13,728 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:52:13,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:52:13,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:52:13,728 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:52:13,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:52:13,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:52:13,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:52:13,729 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:52:13,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:52:13,729 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:52:13,729 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:52:13,729 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:52:13,729 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:52:13,729 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:52:13,729 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:52:13,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:52:13,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:52:13,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:52:13,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:52:13,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:52:13,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:52:13,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:52:13,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:52:13,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:52:13,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:52:13,730 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:52:13,730 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:52:13,730 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:52:13,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:52:13,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:52:13,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:52:13,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:52:13,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:52:13,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:52:13,731 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c0f41b7d074691792fd10e7dba36f11652ac022c2313237070654cd8c5fa3312 [2025-01-08 22:52:13,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:52:13,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:52:13,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:52:13,911 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:52:13,911 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:52:13,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label02.c [2025-01-08 22:52:15,106 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/024a532ec/a969bb27e7d442c381e8729e72838e98/FLAG287cebc23 [2025-01-08 22:52:15,421 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:52:15,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label02.c [2025-01-08 22:52:15,439 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/024a532ec/a969bb27e7d442c381e8729e72838e98/FLAG287cebc23 [2025-01-08 22:52:15,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/024a532ec/a969bb27e7d442c381e8729e72838e98 [2025-01-08 22:52:15,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:52:15,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:52:15,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:52:15,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:52:15,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:52:15,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:52:15" (1/1) ... [2025-01-08 22:52:15,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d076140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:15, skipping insertion in model container [2025-01-08 22:52:15,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:52:15" (1/1) ... [2025-01-08 22:52:15,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:52:15,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label02.c[16747,16760] [2025-01-08 22:52:15,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:52:15,703 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:52:15,757 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label02.c[16747,16760] [2025-01-08 22:52:15,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:52:15,787 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:52:15,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:15 WrapperNode [2025-01-08 22:52:15,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:52:15,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:52:15,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:52:15,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:52:15,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:15" (1/1) ... [2025-01-08 22:52:15,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:15" (1/1) ... [2025-01-08 22:52:15,837 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-01-08 22:52:15,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:52:15,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:52:15,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:52:15,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:52:15,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:15" (1/1) ... [2025-01-08 22:52:15,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:15" (1/1) ... [2025-01-08 22:52:15,860 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:15" (1/1) ... [2025-01-08 22:52:15,877 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-01-08 22:52:15,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:15" (1/1) ... [2025-01-08 22:52:15,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:15" (1/1) ... [2025-01-08 22:52:15,898 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:15" (1/1) ... [2025-01-08 22:52:15,903 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:15" (1/1) ... [2025-01-08 22:52:15,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:15" (1/1) ... [2025-01-08 22:52:15,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:15" (1/1) ... [2025-01-08 22:52:15,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:15" (1/1) ... [2025-01-08 22:52:15,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:52:15,929 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:52:15,929 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:52:15,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:52:15,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:15" (1/1) ... [2025-01-08 22:52:15,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:52:15,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:52:15,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:52:15,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:52:15,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:52:15,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:52:15,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:52:15,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:52:16,026 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:52:16,028 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:52:16,734 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-01-08 22:52:16,734 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:52:16,746 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:52:16,746 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:52:16,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:52:16 BoogieIcfgContainer [2025-01-08 22:52:16,746 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:52:16,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:52:16,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:52:16,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:52:16,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:52:15" (1/3) ... [2025-01-08 22:52:16,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a30026b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:52:16, skipping insertion in model container [2025-01-08 22:52:16,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:15" (2/3) ... [2025-01-08 22:52:16,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a30026b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:52:16, skipping insertion in model container [2025-01-08 22:52:16,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:52:16" (3/3) ... [2025-01-08 22:52:16,755 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label02.c [2025-01-08 22:52:16,764 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:52:16,766 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label02.c that has 1 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:52:16,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:52:16,820 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;@4733838e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:52:16,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:52:16,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 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-01-08 22:52:16,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-08 22:52:16,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:16,831 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:52:16,832 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:16,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:16,835 INFO L85 PathProgramCache]: Analyzing trace with hash 3214007, now seen corresponding path program 1 times [2025-01-08 22:52:16,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:16,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219415495] [2025-01-08 22:52:16,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:16,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:16,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-08 22:52:16,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-08 22:52:16,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:16,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:17,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:52:17,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:17,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219415495] [2025-01-08 22:52:17,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219415495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:17,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:17,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:52:17,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083517331] [2025-01-08 22:52:17,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:17,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:17,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:17,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:17,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:17,265 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:17,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:17,820 INFO L93 Difference]: Finished difference Result 553 states and 937 transitions. [2025-01-08 22:52:17,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:17,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-08 22:52:17,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:17,827 INFO L225 Difference]: With dead ends: 553 [2025-01-08 22:52:17,827 INFO L226 Difference]: Without dead ends: 266 [2025-01-08 22:52:17,829 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-01-08 22:52:17,831 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 95 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:17,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 72 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:52:17,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-01-08 22:52:17,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-01-08 22:52:17,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4339622641509433) internal successors, (380), 265 states have internal predecessors, (380), 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-01-08 22:52:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2025-01-08 22:52:17,872 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 90 [2025-01-08 22:52:17,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:17,876 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2025-01-08 22:52:17,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:17,877 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2025-01-08 22:52:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-08 22:52:17,878 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:17,878 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:52:17,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:52:17,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:17,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:17,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1507564714, now seen corresponding path program 1 times [2025-01-08 22:52:17,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:17,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769638502] [2025-01-08 22:52:17,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:17,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:17,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-08 22:52:17,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-08 22:52:17,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:17,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:52:18,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:18,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769638502] [2025-01-08 22:52:18,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769638502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:18,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:18,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:52:18,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144121292] [2025-01-08 22:52:18,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:18,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:18,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:18,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:18,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:18,046 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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-01-08 22:52:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:18,398 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2025-01-08 22:52:18,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:18,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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 96 [2025-01-08 22:52:18,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:18,401 INFO L225 Difference]: With dead ends: 792 [2025-01-08 22:52:18,401 INFO L226 Difference]: Without dead ends: 528 [2025-01-08 22:52:18,401 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-01-08 22:52:18,402 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 145 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:18,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 17 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:52:18,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-01-08 22:52:18,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-01-08 22:52:18,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.413662239089184) internal successors, (745), 527 states have internal predecessors, (745), 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-01-08 22:52:18,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 745 transitions. [2025-01-08 22:52:18,423 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 745 transitions. Word has length 96 [2025-01-08 22:52:18,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:18,424 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 745 transitions. [2025-01-08 22:52:18,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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-01-08 22:52:18,424 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 745 transitions. [2025-01-08 22:52:18,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-08 22:52:18,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:18,426 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:52:18,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:52:18,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:18,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:18,426 INFO L85 PathProgramCache]: Analyzing trace with hash -791423387, now seen corresponding path program 1 times [2025-01-08 22:52:18,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:18,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621478072] [2025-01-08 22:52:18,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:18,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:18,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-08 22:52:18,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-08 22:52:18,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:18,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:18,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:52:18,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:18,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621478072] [2025-01-08 22:52:18,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621478072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:18,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:18,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:52:18,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861769545] [2025-01-08 22:52:18,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:18,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:18,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:18,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:18,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:18,532 INFO L87 Difference]: Start difference. First operand 528 states and 745 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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-01-08 22:52:18,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:18,960 INFO L93 Difference]: Finished difference Result 1578 states and 2230 transitions. [2025-01-08 22:52:18,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:18,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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 97 [2025-01-08 22:52:18,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:18,967 INFO L225 Difference]: With dead ends: 1578 [2025-01-08 22:52:18,967 INFO L226 Difference]: Without dead ends: 1052 [2025-01-08 22:52:18,969 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-01-08 22:52:18,971 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 54 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:18,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 37 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:52:18,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2025-01-08 22:52:19,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2025-01-08 22:52:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.3444338725023788) internal successors, (1413), 1051 states have internal predecessors, (1413), 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-01-08 22:52:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1413 transitions. [2025-01-08 22:52:19,017 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1413 transitions. Word has length 97 [2025-01-08 22:52:19,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:19,022 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1413 transitions. [2025-01-08 22:52:19,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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-01-08 22:52:19,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1413 transitions. [2025-01-08 22:52:19,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-08 22:52:19,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:19,024 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:52:19,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:52:19,024 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:19,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:19,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1626816669, now seen corresponding path program 1 times [2025-01-08 22:52:19,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:19,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904185451] [2025-01-08 22:52:19,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:19,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:19,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-08 22:52:19,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-08 22:52:19,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:19,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:52:19,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:19,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904185451] [2025-01-08 22:52:19,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904185451] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:19,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:19,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:52:19,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230530281] [2025-01-08 22:52:19,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:19,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:19,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:19,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:19,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:19,263 INFO L87 Difference]: Start difference. First operand 1052 states and 1413 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:19,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:19,587 INFO L93 Difference]: Finished difference Result 2495 states and 3313 transitions. [2025-01-08 22:52:19,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:19,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-01-08 22:52:19,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:19,592 INFO L225 Difference]: With dead ends: 2495 [2025-01-08 22:52:19,593 INFO L226 Difference]: Without dead ends: 1445 [2025-01-08 22:52:19,594 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-01-08 22:52:19,595 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 120 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:19,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 56 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:52:19,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2025-01-08 22:52:19,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1314. [2025-01-08 22:52:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1313 states have (on average 1.3031226199543031) internal successors, (1711), 1313 states have internal predecessors, (1711), 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-01-08 22:52:19,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1711 transitions. [2025-01-08 22:52:19,613 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1711 transitions. Word has length 112 [2025-01-08 22:52:19,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:19,613 INFO L471 AbstractCegarLoop]: Abstraction has 1314 states and 1711 transitions. [2025-01-08 22:52:19,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:19,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1711 transitions. [2025-01-08 22:52:19,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-08 22:52:19,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:19,615 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:52:19,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:52:19,615 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:19,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:19,616 INFO L85 PathProgramCache]: Analyzing trace with hash 111251263, now seen corresponding path program 1 times [2025-01-08 22:52:19,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:19,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914341032] [2025-01-08 22:52:19,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:19,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:19,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-08 22:52:19,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-08 22:52:19,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:19,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:52:19,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:19,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914341032] [2025-01-08 22:52:19,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914341032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:19,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:19,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:52:19,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026161445] [2025-01-08 22:52:19,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:19,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:19,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:19,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:19,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:19,679 INFO L87 Difference]: Start difference. First operand 1314 states and 1711 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-01-08 22:52:19,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:19,998 INFO L93 Difference]: Finished difference Result 3412 states and 4411 transitions. [2025-01-08 22:52:19,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:19,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 113 [2025-01-08 22:52:19,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:20,004 INFO L225 Difference]: With dead ends: 3412 [2025-01-08 22:52:20,005 INFO L226 Difference]: Without dead ends: 2100 [2025-01-08 22:52:20,006 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-01-08 22:52:20,007 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 117 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:20,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 204 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:52:20,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2025-01-08 22:52:20,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2100. [2025-01-08 22:52:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.244402096236303) internal successors, (2612), 2099 states have internal predecessors, (2612), 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-01-08 22:52:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2612 transitions. [2025-01-08 22:52:20,036 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2612 transitions. Word has length 113 [2025-01-08 22:52:20,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:20,036 INFO L471 AbstractCegarLoop]: Abstraction has 2100 states and 2612 transitions. [2025-01-08 22:52:20,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-01-08 22:52:20,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2612 transitions. [2025-01-08 22:52:20,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-08 22:52:20,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:20,039 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:52:20,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:52:20,039 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:20,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:20,040 INFO L85 PathProgramCache]: Analyzing trace with hash -330387851, now seen corresponding path program 1 times [2025-01-08 22:52:20,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:20,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064232111] [2025-01-08 22:52:20,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:20,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:20,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-08 22:52:20,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-08 22:52:20,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:20,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:20,169 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-08 22:52:20,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:20,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064232111] [2025-01-08 22:52:20,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064232111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:20,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:20,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:52:20,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120754244] [2025-01-08 22:52:20,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:20,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:20,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:20,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:20,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:20,172 INFO L87 Difference]: Start difference. First operand 2100 states and 2612 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 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-01-08 22:52:20,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:20,494 INFO L93 Difference]: Finished difference Result 5115 states and 6430 transitions. [2025-01-08 22:52:20,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:20,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2025-01-08 22:52:20,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:20,501 INFO L225 Difference]: With dead ends: 5115 [2025-01-08 22:52:20,501 INFO L226 Difference]: Without dead ends: 2755 [2025-01-08 22:52:20,504 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-01-08 22:52:20,504 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 133 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:20,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 67 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:52:20,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2025-01-08 22:52:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2493. [2025-01-08 22:52:20,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2493 states, 2492 states have (on average 1.148876404494382) internal successors, (2863), 2492 states have internal predecessors, (2863), 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-01-08 22:52:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 2863 transitions. [2025-01-08 22:52:20,536 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 2863 transitions. Word has length 117 [2025-01-08 22:52:20,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:20,536 INFO L471 AbstractCegarLoop]: Abstraction has 2493 states and 2863 transitions. [2025-01-08 22:52:20,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 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-01-08 22:52:20,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 2863 transitions. [2025-01-08 22:52:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-08 22:52:20,538 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:20,539 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:52:20,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:52:20,539 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:20,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:20,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1729358973, now seen corresponding path program 1 times [2025-01-08 22:52:20,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:20,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005043148] [2025-01-08 22:52:20,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:20,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:20,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-08 22:52:20,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-08 22:52:20,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:20,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:20,638 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-08 22:52:20,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:20,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005043148] [2025-01-08 22:52:20,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005043148] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:20,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:20,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:52:20,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170722829] [2025-01-08 22:52:20,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:20,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:52:20,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:20,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:52:20,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:52:20,640 INFO L87 Difference]: Start difference. First operand 2493 states and 2863 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 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-01-08 22:52:21,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:21,103 INFO L93 Difference]: Finished difference Result 5115 states and 5875 transitions. [2025-01-08 22:52:21,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:52:21,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2025-01-08 22:52:21,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:21,110 INFO L225 Difference]: With dead ends: 5115 [2025-01-08 22:52:21,110 INFO L226 Difference]: Without dead ends: 2624 [2025-01-08 22:52:21,112 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-01-08 22:52:21,112 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 255 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:21,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 44 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:52:21,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2025-01-08 22:52:21,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2624. [2025-01-08 22:52:21,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2624 states, 2623 states have (on average 1.1204727411361037) internal successors, (2939), 2623 states have internal predecessors, (2939), 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-01-08 22:52:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 2939 transitions. [2025-01-08 22:52:21,142 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 2939 transitions. Word has length 121 [2025-01-08 22:52:21,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:21,142 INFO L471 AbstractCegarLoop]: Abstraction has 2624 states and 2939 transitions. [2025-01-08 22:52:21,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 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-01-08 22:52:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 2939 transitions. [2025-01-08 22:52:21,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-08 22:52:21,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:21,145 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 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-01-08 22:52:21,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:52:21,145 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:21,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:21,145 INFO L85 PathProgramCache]: Analyzing trace with hash 107275190, now seen corresponding path program 1 times [2025-01-08 22:52:21,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:21,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769498821] [2025-01-08 22:52:21,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:21,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:21,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-08 22:52:21,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-08 22:52:21,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:21,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-08 22:52:21,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:21,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769498821] [2025-01-08 22:52:21,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769498821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:21,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:21,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:52:21,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275054371] [2025-01-08 22:52:21,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:21,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:52:21,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:21,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:52:21,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:52:21,276 INFO L87 Difference]: Start difference. First operand 2624 states and 2939 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 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-01-08 22:52:21,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:21,736 INFO L93 Difference]: Finished difference Result 5770 states and 6524 transitions. [2025-01-08 22:52:21,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:52:21,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 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 150 [2025-01-08 22:52:21,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:21,743 INFO L225 Difference]: With dead ends: 5770 [2025-01-08 22:52:21,743 INFO L226 Difference]: Without dead ends: 3148 [2025-01-08 22:52:21,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:52:21,745 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 245 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:21,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 40 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:52:21,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2025-01-08 22:52:21,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 2100. [2025-01-08 22:52:21,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.132444020962363) internal successors, (2377), 2099 states have internal predecessors, (2377), 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-01-08 22:52:21,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2377 transitions. [2025-01-08 22:52:21,768 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2377 transitions. Word has length 150 [2025-01-08 22:52:21,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:21,769 INFO L471 AbstractCegarLoop]: Abstraction has 2100 states and 2377 transitions. [2025-01-08 22:52:21,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 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-01-08 22:52:21,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2377 transitions. [2025-01-08 22:52:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-08 22:52:21,771 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:21,771 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:52:21,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:52:21,772 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:21,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1585494130, now seen corresponding path program 1 times [2025-01-08 22:52:21,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:21,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699509572] [2025-01-08 22:52:21,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:21,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:21,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-08 22:52:21,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-08 22:52:21,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:21,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:21,897 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-08 22:52:21,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:21,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699509572] [2025-01-08 22:52:21,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699509572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:21,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:21,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:52:21,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660746000] [2025-01-08 22:52:21,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:21,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:21,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:21,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:21,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:21,898 INFO L87 Difference]: Start difference. First operand 2100 states and 2377 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:22,158 INFO L93 Difference]: Finished difference Result 4460 states and 5025 transitions. [2025-01-08 22:52:22,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:22,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2025-01-08 22:52:22,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:22,163 INFO L225 Difference]: With dead ends: 4460 [2025-01-08 22:52:22,163 INFO L226 Difference]: Without dead ends: 2362 [2025-01-08 22:52:22,165 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-01-08 22:52:22,165 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 93 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:22,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 37 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:52:22,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2025-01-08 22:52:22,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2100. [2025-01-08 22:52:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.130061934254407) internal successors, (2372), 2099 states have internal predecessors, (2372), 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-01-08 22:52:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2372 transitions. [2025-01-08 22:52:22,209 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2372 transitions. Word has length 167 [2025-01-08 22:52:22,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:22,209 INFO L471 AbstractCegarLoop]: Abstraction has 2100 states and 2372 transitions. [2025-01-08 22:52:22,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:22,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2372 transitions. [2025-01-08 22:52:22,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-08 22:52:22,211 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:22,212 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:52:22,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:52:22,212 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:22,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:22,212 INFO L85 PathProgramCache]: Analyzing trace with hash 457058548, now seen corresponding path program 1 times [2025-01-08 22:52:22,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:22,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388907590] [2025-01-08 22:52:22,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:22,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:22,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-08 22:52:22,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-08 22:52:22,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:22,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:22,394 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-01-08 22:52:22,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:22,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388907590] [2025-01-08 22:52:22,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388907590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:22,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:22,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:52:22,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173060561] [2025-01-08 22:52:22,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:22,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:52:22,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:22,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:52:22,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:52:22,396 INFO L87 Difference]: Start difference. First operand 2100 states and 2372 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 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-01-08 22:52:22,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:22,783 INFO L93 Difference]: Finished difference Result 4198 states and 4742 transitions. [2025-01-08 22:52:22,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:52:22,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 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 192 [2025-01-08 22:52:22,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:22,788 INFO L225 Difference]: With dead ends: 4198 [2025-01-08 22:52:22,788 INFO L226 Difference]: Without dead ends: 2100 [2025-01-08 22:52:22,790 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-01-08 22:52:22,790 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 372 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:22,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 42 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:52:22,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2025-01-08 22:52:22,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2100. [2025-01-08 22:52:22,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.1238685088137208) internal successors, (2359), 2099 states have internal predecessors, (2359), 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-01-08 22:52:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2359 transitions. [2025-01-08 22:52:22,811 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2359 transitions. Word has length 192 [2025-01-08 22:52:22,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:22,811 INFO L471 AbstractCegarLoop]: Abstraction has 2100 states and 2359 transitions. [2025-01-08 22:52:22,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 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-01-08 22:52:22,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2359 transitions. [2025-01-08 22:52:22,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-08 22:52:22,814 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:22,814 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:52:22,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:52:22,815 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:22,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:22,815 INFO L85 PathProgramCache]: Analyzing trace with hash -644260429, now seen corresponding path program 1 times [2025-01-08 22:52:22,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:22,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859509788] [2025-01-08 22:52:22,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:22,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:22,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-08 22:52:22,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-08 22:52:22,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:22,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:22,921 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-01-08 22:52:22,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:22,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859509788] [2025-01-08 22:52:22,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859509788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:22,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:22,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:52:22,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718224227] [2025-01-08 22:52:22,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:22,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:22,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:22,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:22,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:22,922 INFO L87 Difference]: Start difference. First operand 2100 states and 2359 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-01-08 22:52:23,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:23,194 INFO L93 Difference]: Finished difference Result 4460 states and 4989 transitions. [2025-01-08 22:52:23,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:23,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 210 [2025-01-08 22:52:23,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:23,199 INFO L225 Difference]: With dead ends: 4460 [2025-01-08 22:52:23,199 INFO L226 Difference]: Without dead ends: 2362 [2025-01-08 22:52:23,201 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-01-08 22:52:23,201 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 86 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:23,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 179 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:52:23,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2025-01-08 22:52:23,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2231. [2025-01-08 22:52:23,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 2230 states have (on average 1.1022421524663677) internal successors, (2458), 2230 states have internal predecessors, (2458), 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-01-08 22:52:23,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2458 transitions. [2025-01-08 22:52:23,223 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2458 transitions. Word has length 210 [2025-01-08 22:52:23,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:23,223 INFO L471 AbstractCegarLoop]: Abstraction has 2231 states and 2458 transitions. [2025-01-08 22:52:23,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-01-08 22:52:23,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2458 transitions. [2025-01-08 22:52:23,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-01-08 22:52:23,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:23,226 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:52:23,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 22:52:23,227 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:23,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:23,227 INFO L85 PathProgramCache]: Analyzing trace with hash -658983313, now seen corresponding path program 1 times [2025-01-08 22:52:23,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:23,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600541306] [2025-01-08 22:52:23,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:23,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:23,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-08 22:52:23,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-08 22:52:23,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:23,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-08 22:52:23,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:23,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600541306] [2025-01-08 22:52:23,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600541306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:23,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:23,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:52:23,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930734349] [2025-01-08 22:52:23,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:23,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:23,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:23,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:23,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:23,308 INFO L87 Difference]: Start difference. First operand 2231 states and 2458 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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-01-08 22:52:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:23,569 INFO L93 Difference]: Finished difference Result 4591 states and 5071 transitions. [2025-01-08 22:52:23,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:23,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 223 [2025-01-08 22:52:23,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:23,574 INFO L225 Difference]: With dead ends: 4591 [2025-01-08 22:52:23,574 INFO L226 Difference]: Without dead ends: 2362 [2025-01-08 22:52:23,576 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-01-08 22:52:23,577 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 96 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:23,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 163 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:52:23,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2025-01-08 22:52:23,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2362. [2025-01-08 22:52:23,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2361 states have (on average 1.0897924608216858) internal successors, (2573), 2361 states have internal predecessors, (2573), 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-01-08 22:52:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2573 transitions. [2025-01-08 22:52:23,617 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2573 transitions. Word has length 223 [2025-01-08 22:52:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:23,617 INFO L471 AbstractCegarLoop]: Abstraction has 2362 states and 2573 transitions. [2025-01-08 22:52:23,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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-01-08 22:52:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2573 transitions. [2025-01-08 22:52:23,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-01-08 22:52:23,620 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:23,620 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:52:23,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 22:52:23,621 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:23,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:23,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2746535, now seen corresponding path program 1 times [2025-01-08 22:52:23,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:23,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357330491] [2025-01-08 22:52:23,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:23,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:23,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-01-08 22:52:23,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-01-08 22:52:23,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:23,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 143 proven. 86 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-08 22:52:23,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:23,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357330491] [2025-01-08 22:52:23,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357330491] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:52:23,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54045863] [2025-01-08 22:52:23,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:23,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:52:23,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:52:23,924 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:52:23,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 22:52:23,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-01-08 22:52:24,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-01-08 22:52:24,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:24,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:24,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:52:24,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:52:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-01-08 22:52:24,144 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:52:24,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54045863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:24,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:52:24,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 22:52:24,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212302382] [2025-01-08 22:52:24,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:24,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:24,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:24,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:24,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:52:24,145 INFO L87 Difference]: Start difference. First operand 2362 states and 2573 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-01-08 22:52:24,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:24,416 INFO L93 Difference]: Finished difference Result 4722 states and 5144 transitions. [2025-01-08 22:52:24,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:24,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 235 [2025-01-08 22:52:24,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:24,421 INFO L225 Difference]: With dead ends: 4722 [2025-01-08 22:52:24,421 INFO L226 Difference]: Without dead ends: 2362 [2025-01-08 22:52:24,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:52:24,424 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 55 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:24,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 18 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:52:24,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2025-01-08 22:52:24,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2100. [2025-01-08 22:52:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.0890900428775607) internal successors, (2286), 2099 states have internal predecessors, (2286), 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-01-08 22:52:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2286 transitions. [2025-01-08 22:52:24,450 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2286 transitions. Word has length 235 [2025-01-08 22:52:24,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:24,450 INFO L471 AbstractCegarLoop]: Abstraction has 2100 states and 2286 transitions. [2025-01-08 22:52:24,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-01-08 22:52:24,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2286 transitions. [2025-01-08 22:52:24,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-01-08 22:52:24,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:24,453 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-01-08 22:52:24,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 22:52:24,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-08 22:52:24,654 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:24,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:24,655 INFO L85 PathProgramCache]: Analyzing trace with hash 275932959, now seen corresponding path program 1 times [2025-01-08 22:52:24,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:24,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184997953] [2025-01-08 22:52:24,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:24,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:24,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-01-08 22:52:24,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-01-08 22:52:24,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:24,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 168 proven. 92 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-08 22:52:24,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:24,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184997953] [2025-01-08 22:52:24,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184997953] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:52:24,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983517501] [2025-01-08 22:52:24,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:24,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:52:24,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:52:24,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:52:24,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:52:24,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-01-08 22:52:24,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-01-08 22:52:24,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:24,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:24,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:52:24,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:52:25,138 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-01-08 22:52:25,138 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:52:25,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983517501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:25,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:52:25,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-08 22:52:25,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11162869] [2025-01-08 22:52:25,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:25,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:25,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:25,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:25,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:52:25,139 INFO L87 Difference]: Start difference. First operand 2100 states and 2286 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-01-08 22:52:25,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:25,434 INFO L93 Difference]: Finished difference Result 4589 states and 5011 transitions. [2025-01-08 22:52:25,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:25,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 241 [2025-01-08 22:52:25,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:25,435 INFO L225 Difference]: With dead ends: 4589 [2025-01-08 22:52:25,436 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 22:52:25,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:52:25,438 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 49 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:25,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 175 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:52:25,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 22:52:25,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 22:52:25,439 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-01-08 22:52:25,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 22:52:25,439 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 241 [2025-01-08 22:52:25,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:25,439 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 22:52:25,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-01-08 22:52:25,440 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 22:52:25,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 22:52:25,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:52:25,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 22:52:25,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:52:25,645 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:52:25,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 22:52:25,759 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:52:25,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:52:25 BoogieIcfgContainer [2025-01-08 22:52:25,770 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:52:25,771 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:52:25,771 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:52:25,771 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:52:25,772 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:52:16" (3/4) ... [2025-01-08 22:52:25,773 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 22:52:25,783 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 22:52:25,784 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 22:52:25,784 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 22:52:25,785 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 22:52:25,878 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 22:52:25,878 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 22:52:25,878 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:52:25,879 INFO L158 Benchmark]: Toolchain (without parser) took 10422.96ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 103.6MB in the beginning and 249.5MB in the end (delta: -145.9MB). Peak memory consumption was 179.0MB. Max. memory is 16.1GB. [2025-01-08 22:52:25,879 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:52:25,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.72ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 75.0MB in the end (delta: 28.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-08 22:52:25,880 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.83ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 69.3MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:52:25,880 INFO L158 Benchmark]: Boogie Preprocessor took 90.00ms. Allocated memory is still 142.6MB. Free memory was 69.3MB in the beginning and 64.8MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:52:25,880 INFO L158 Benchmark]: RCFGBuilder took 817.25ms. Allocated memory is still 142.6MB. Free memory was 64.8MB in the beginning and 49.5MB in the end (delta: 15.3MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2025-01-08 22:52:25,881 INFO L158 Benchmark]: TraceAbstraction took 9022.86ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 48.8MB in the beginning and 261.8MB in the end (delta: -213.1MB). Peak memory consumption was 112.1MB. Max. memory is 16.1GB. [2025-01-08 22:52:25,881 INFO L158 Benchmark]: Witness Printer took 107.37ms. Allocated memory is still 469.8MB. Free memory was 261.8MB in the beginning and 249.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:52:25,883 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.13ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.72ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 75.0MB in the end (delta: 28.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.83ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 69.3MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 90.00ms. Allocated memory is still 142.6MB. Free memory was 69.3MB in the beginning and 64.8MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 817.25ms. Allocated memory is still 142.6MB. Free memory was 64.8MB in the beginning and 49.5MB in the end (delta: 15.3MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9022.86ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 48.8MB in the beginning and 261.8MB in the end (delta: -213.1MB). Peak memory consumption was 112.1MB. Max. memory is 16.1GB. * Witness Printer took 107.37ms. Allocated memory is still 469.8MB. Free memory was 261.8MB in the beginning and 249.5MB in the end (delta: 12.3MB). 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: 456]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1915 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1915 mSDsluCounter, 1151 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 736 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5288 IncrementalHoareTripleChecker+Invalid, 6024 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 736 mSolverCounterUnsat, 1059 mSDtfsCounter, 5288 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 516 GetRequests, 494 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2624occurred in iteration=7, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 2096 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2640 NumberOfCodeBlocks, 2640 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2624 ConstructedInterpolants, 0 QuantifiedInterpolants, 7264 SizeOfPredicates, 0 NumberOfNonLiveVariables, 870 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 2152/2330 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: 593]: Loop Invariant Derived loop invariant: (((((((a20 != 1) || ((a7 != 1) && (a21 == 1))) || ((a17 == 1) && (a16 <= 4))) || ((a21 <= 0) && (a16 <= 4))) || (5 < a16)) || ((a21 <= 0) && (a17 == 1))) || ((5 == a16) && (a21 == 1))) RESULT: Ultimate proved your program to be correct! [2025-01-08 22:52:25,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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