./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label35.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/Problem11_label35.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 332223a74015f37ef1848305a6dc2d3188fda0d257576dbd7b4025d0bb05f229 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:42:21,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:42:21,957 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:42:21,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:42:21,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:42:21,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:42:21,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:42:21,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:42:21,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:42:21,976 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:42:21,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:42:21,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:42:21,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:42:21,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:42:21,977 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:42:21,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:42:21,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:42:21,977 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:42:21,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:42:21,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:42:21,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:42:21,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:42:21,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:42:21,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:42:21,977 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:42:21,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:42:21,978 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:42:21,978 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:42:21,978 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:42:21,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:42:21,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:42:21,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:42:21,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:42:21,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:42:21,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:42:21,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:42:21,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:42:21,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:42:21,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:42:21,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:42:21,979 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:42:21,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:42:21,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:42:21,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:42:21,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:42:21,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:42:21,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:42:21,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:42:21,979 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 -> 332223a74015f37ef1848305a6dc2d3188fda0d257576dbd7b4025d0bb05f229 [2025-01-08 23:42:22,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:42:22,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:42:22,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:42:22,197 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:42:22,197 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:42:22,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label35.c [2025-01-08 23:42:23,435 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78c832897/827ab263bb0a4fe4ac31060c7942e7d8/FLAG850416bda [2025-01-08 23:42:23,765 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:42:23,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label35.c [2025-01-08 23:42:23,776 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78c832897/827ab263bb0a4fe4ac31060c7942e7d8/FLAG850416bda [2025-01-08 23:42:23,787 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78c832897/827ab263bb0a4fe4ac31060c7942e7d8 [2025-01-08 23:42:23,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:42:23,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:42:23,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:42:23,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:42:23,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:42:23,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:42:23" (1/1) ... [2025-01-08 23:42:23,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31c635d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:23, skipping insertion in model container [2025-01-08 23:42:23,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:42:23" (1/1) ... [2025-01-08 23:42:23,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:42:23,971 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/Problem11_label35.c[8398,8411] [2025-01-08 23:42:24,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:42:24,096 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:42:24,112 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/Problem11_label35.c[8398,8411] [2025-01-08 23:42:24,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:42:24,192 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:42:24,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:24 WrapperNode [2025-01-08 23:42:24,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:42:24,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:42:24,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:42:24,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:42:24,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:24" (1/1) ... [2025-01-08 23:42:24,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:24" (1/1) ... [2025-01-08 23:42:24,278 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-01-08 23:42:24,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:42:24,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:42:24,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:42:24,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:42:24,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:24" (1/1) ... [2025-01-08 23:42:24,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:24" (1/1) ... [2025-01-08 23:42:24,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:24" (1/1) ... [2025-01-08 23:42:24,330 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 23:42:24,331 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:24" (1/1) ... [2025-01-08 23:42:24,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:24" (1/1) ... [2025-01-08 23:42:24,350 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:24" (1/1) ... [2025-01-08 23:42:24,357 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:24" (1/1) ... [2025-01-08 23:42:24,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:24" (1/1) ... [2025-01-08 23:42:24,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:24" (1/1) ... [2025-01-08 23:42:24,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:24" (1/1) ... [2025-01-08 23:42:24,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:42:24,386 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:42:24,386 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:42:24,386 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:42:24,387 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:24" (1/1) ... [2025-01-08 23:42:24,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:42:24,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:42:24,414 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 23:42:24,417 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 23:42:24,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:42:24,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:42:24,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:42:24,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:42:24,497 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:42:24,498 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:42:25,684 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-01-08 23:42:25,684 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:42:25,694 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:42:25,694 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:42:25,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:42:25 BoogieIcfgContainer [2025-01-08 23:42:25,694 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:42:25,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:42:25,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:42:25,699 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:42:25,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:42:23" (1/3) ... [2025-01-08 23:42:25,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec4b288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:42:25, skipping insertion in model container [2025-01-08 23:42:25,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:24" (2/3) ... [2025-01-08 23:42:25,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec4b288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:42:25, skipping insertion in model container [2025-01-08 23:42:25,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:42:25" (3/3) ... [2025-01-08 23:42:25,700 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label35.c [2025-01-08 23:42:25,709 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:42:25,711 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label35.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:42:25,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:42:25,752 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;@674931f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:42:25,753 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:42:25,756 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 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 23:42:25,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-08 23:42:25,760 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:25,761 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] [2025-01-08 23:42:25,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:25,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:25,764 INFO L85 PathProgramCache]: Analyzing trace with hash -747821350, now seen corresponding path program 1 times [2025-01-08 23:42:25,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:25,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102769110] [2025-01-08 23:42:25,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:25,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:25,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-08 23:42:25,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-08 23:42:25,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:25,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:26,044 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 23:42:26,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:26,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102769110] [2025-01-08 23:42:26,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102769110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:26,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:26,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:42:26,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868097038] [2025-01-08 23:42:26,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:26,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:26,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:26,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:26,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:26,073 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 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 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 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 23:42:26,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:26,941 INFO L93 Difference]: Finished difference Result 761 states and 1342 transitions. [2025-01-08 23:42:26,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:26,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-01-08 23:42:26,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:26,950 INFO L225 Difference]: With dead ends: 761 [2025-01-08 23:42:26,950 INFO L226 Difference]: Without dead ends: 413 [2025-01-08 23:42:26,953 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 23:42:26,955 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 170 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:26,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 223 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:42:26,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-01-08 23:42:26,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-01-08 23:42:26,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 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 23:42:26,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2025-01-08 23:42:26,994 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 58 [2025-01-08 23:42:26,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:26,994 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2025-01-08 23:42:26,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 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 23:42:26,995 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2025-01-08 23:42:26,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-08 23:42:26,998 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:27,000 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:27,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:42:27,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:27,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:27,001 INFO L85 PathProgramCache]: Analyzing trace with hash -589702350, now seen corresponding path program 1 times [2025-01-08 23:42:27,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:27,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722031879] [2025-01-08 23:42:27,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:27,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:27,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-08 23:42:27,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-08 23:42:27,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:27,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:27,279 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:27,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:27,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722031879] [2025-01-08 23:42:27,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722031879] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:27,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:27,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:42:27,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991641052] [2025-01-08 23:42:27,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:27,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:27,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:27,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:27,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:27,281 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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 23:42:28,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:28,004 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2025-01-08 23:42:28,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:28,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-01-08 23:42:28,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:28,011 INFO L225 Difference]: With dead ends: 1211 [2025-01-08 23:42:28,011 INFO L226 Difference]: Without dead ends: 800 [2025-01-08 23:42:28,012 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 23:42:28,012 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:28,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 119 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:42:28,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-01-08 23:42:28,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2025-01-08 23:42:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3756345177664975) internal successors, (1084), 788 states have internal predecessors, (1084), 0 states have call successors, (0), 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 23:42:28,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions. [2025-01-08 23:42:28,044 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 126 [2025-01-08 23:42:28,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:28,044 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions. [2025-01-08 23:42:28,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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 23:42:28,044 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions. [2025-01-08 23:42:28,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-08 23:42:28,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:28,050 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:28,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:42:28,050 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:28,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:28,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1391461393, now seen corresponding path program 1 times [2025-01-08 23:42:28,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:28,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455286435] [2025-01-08 23:42:28,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:28,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:28,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-08 23:42:28,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-08 23:42:28,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:28,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:28,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:28,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455286435] [2025-01-08 23:42:28,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455286435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:28,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:28,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:42:28,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293528210] [2025-01-08 23:42:28,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:28,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:28,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:28,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:28,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:28,312 INFO L87 Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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 23:42:28,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:28,933 INFO L93 Difference]: Finished difference Result 2314 states and 3184 transitions. [2025-01-08 23:42:28,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:28,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-01-08 23:42:28,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:28,938 INFO L225 Difference]: With dead ends: 2314 [2025-01-08 23:42:28,939 INFO L226 Difference]: Without dead ends: 1527 [2025-01-08 23:42:28,940 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 23:42:28,940 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 120 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:28,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 193 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:28,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2025-01-08 23:42:28,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1526. [2025-01-08 23:42:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 1.2177049180327868) internal successors, (1857), 1525 states have internal predecessors, (1857), 0 states have call successors, (0), 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 23:42:28,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1857 transitions. [2025-01-08 23:42:28,999 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1857 transitions. Word has length 127 [2025-01-08 23:42:28,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:28,999 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 1857 transitions. [2025-01-08 23:42:29,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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 23:42:29,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1857 transitions. [2025-01-08 23:42:29,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-01-08 23:42:29,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:29,001 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:42:29,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:42:29,002 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:29,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:29,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1988965994, now seen corresponding path program 1 times [2025-01-08 23:42:29,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:29,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304565494] [2025-01-08 23:42:29,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:29,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:29,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-08 23:42:29,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-08 23:42:29,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:29,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:29,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:29,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304565494] [2025-01-08 23:42:29,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304565494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:29,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:29,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:29,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766446738] [2025-01-08 23:42:29,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:29,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:29,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:29,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:29,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:29,234 INFO L87 Difference]: Start difference. First operand 1526 states and 1857 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 23:42:29,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:29,856 INFO L93 Difference]: Finished difference Result 3614 states and 4471 transitions. [2025-01-08 23:42:29,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:29,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 185 [2025-01-08 23:42:29,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:29,863 INFO L225 Difference]: With dead ends: 3614 [2025-01-08 23:42:29,864 INFO L226 Difference]: Without dead ends: 2274 [2025-01-08 23:42:29,866 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 23:42:29,867 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 147 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:29,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 336 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:29,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2025-01-08 23:42:29,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 1897. [2025-01-08 23:42:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1896 states have (on average 1.2162447257383966) internal successors, (2306), 1896 states have internal predecessors, (2306), 0 states have call successors, (0), 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 23:42:29,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2306 transitions. [2025-01-08 23:42:29,894 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2306 transitions. Word has length 185 [2025-01-08 23:42:29,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:29,895 INFO L471 AbstractCegarLoop]: Abstraction has 1897 states and 2306 transitions. [2025-01-08 23:42:29,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 23:42:29,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2306 transitions. [2025-01-08 23:42:29,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-01-08 23:42:29,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:29,899 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:42:29,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:42:29,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:29,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:29,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1303860499, now seen corresponding path program 1 times [2025-01-08 23:42:29,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:29,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144532485] [2025-01-08 23:42:29,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:29,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:29,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-01-08 23:42:29,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-01-08 23:42:29,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:29,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-08 23:42:30,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:30,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144532485] [2025-01-08 23:42:30,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144532485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:30,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:30,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:30,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070279576] [2025-01-08 23:42:30,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:30,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:30,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:30,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:30,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:30,140 INFO L87 Difference]: Start difference. First operand 1897 states and 2306 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 23:42:30,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:30,696 INFO L93 Difference]: Finished difference Result 4354 states and 5296 transitions. [2025-01-08 23:42:30,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:30,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 239 [2025-01-08 23:42:30,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:30,703 INFO L225 Difference]: With dead ends: 4354 [2025-01-08 23:42:30,703 INFO L226 Difference]: Without dead ends: 2275 [2025-01-08 23:42:30,705 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 23:42:30,707 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 144 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:30,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 348 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:30,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2025-01-08 23:42:30,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 2265. [2025-01-08 23:42:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 2264 states have (on average 1.2137809187279152) internal successors, (2748), 2264 states have internal predecessors, (2748), 0 states have call successors, (0), 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 23:42:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 2748 transitions. [2025-01-08 23:42:30,737 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 2748 transitions. Word has length 239 [2025-01-08 23:42:30,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:30,739 INFO L471 AbstractCegarLoop]: Abstraction has 2265 states and 2748 transitions. [2025-01-08 23:42:30,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 23:42:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 2748 transitions. [2025-01-08 23:42:30,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-01-08 23:42:30,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:30,745 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:30,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:42:30,745 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:30,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:30,746 INFO L85 PathProgramCache]: Analyzing trace with hash 411251145, now seen corresponding path program 1 times [2025-01-08 23:42:30,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:30,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135067002] [2025-01-08 23:42:30,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:30,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:30,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-01-08 23:42:30,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-01-08 23:42:30,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:30,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:30,985 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-01-08 23:42:30,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:30,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135067002] [2025-01-08 23:42:30,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135067002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:30,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:30,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:30,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401973504] [2025-01-08 23:42:30,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:30,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:30,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:30,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:30,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:30,990 INFO L87 Difference]: Start difference. First operand 2265 states and 2748 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 23:42:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:31,605 INFO L93 Difference]: Finished difference Result 5087 states and 6238 transitions. [2025-01-08 23:42:31,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:31,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 240 [2025-01-08 23:42:31,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:31,614 INFO L225 Difference]: With dead ends: 5087 [2025-01-08 23:42:31,614 INFO L226 Difference]: Without dead ends: 2824 [2025-01-08 23:42:31,616 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 23:42:31,618 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 139 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:31,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 379 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:31,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2025-01-08 23:42:31,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 2633. [2025-01-08 23:42:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 2632 states have (on average 1.213145896656535) internal successors, (3193), 2632 states have internal predecessors, (3193), 0 states have call successors, (0), 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 23:42:31,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3193 transitions. [2025-01-08 23:42:31,657 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3193 transitions. Word has length 240 [2025-01-08 23:42:31,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:31,657 INFO L471 AbstractCegarLoop]: Abstraction has 2633 states and 3193 transitions. [2025-01-08 23:42:31,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 23:42:31,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3193 transitions. [2025-01-08 23:42:31,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-01-08 23:42:31,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:31,660 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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 23:42:31,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:42:31,661 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:31,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:31,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1064056855, now seen corresponding path program 1 times [2025-01-08 23:42:31,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:31,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321754156] [2025-01-08 23:42:31,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:31,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:31,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-01-08 23:42:31,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-01-08 23:42:31,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:31,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:32,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:32,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321754156] [2025-01-08 23:42:32,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321754156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:32,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:32,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:42:32,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904697576] [2025-01-08 23:42:32,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:32,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:32,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:32,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:32,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:32,008 INFO L87 Difference]: Start difference. First operand 2633 states and 3193 transitions. Second operand has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 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 23:42:33,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:33,019 INFO L93 Difference]: Finished difference Result 8420 states and 10435 transitions. [2025-01-08 23:42:33,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:33,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 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 260 [2025-01-08 23:42:33,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:33,033 INFO L225 Difference]: With dead ends: 8420 [2025-01-08 23:42:33,033 INFO L226 Difference]: Without dead ends: 5789 [2025-01-08 23:42:33,036 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 23:42:33,037 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 277 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:33,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 210 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:42:33,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5789 states. [2025-01-08 23:42:33,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5789 to 5418. [2025-01-08 23:42:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5418 states, 5417 states have (on average 1.1978955141222078) internal successors, (6489), 5417 states have internal predecessors, (6489), 0 states have call successors, (0), 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 23:42:33,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5418 states to 5418 states and 6489 transitions. [2025-01-08 23:42:33,132 INFO L78 Accepts]: Start accepts. Automaton has 5418 states and 6489 transitions. Word has length 260 [2025-01-08 23:42:33,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:33,133 INFO L471 AbstractCegarLoop]: Abstraction has 5418 states and 6489 transitions. [2025-01-08 23:42:33,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 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 23:42:33,133 INFO L276 IsEmpty]: Start isEmpty. Operand 5418 states and 6489 transitions. [2025-01-08 23:42:33,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-08 23:42:33,136 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:33,136 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:42:33,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:42:33,137 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:33,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:33,137 INFO L85 PathProgramCache]: Analyzing trace with hash 302251390, now seen corresponding path program 1 times [2025-01-08 23:42:33,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:33,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914205165] [2025-01-08 23:42:33,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:33,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:33,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-08 23:42:33,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-08 23:42:33,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:33,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:33,459 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:33,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:33,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914205165] [2025-01-08 23:42:33,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914205165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:33,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:33,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:42:33,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775184661] [2025-01-08 23:42:33,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:33,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:33,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:33,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:33,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:33,461 INFO L87 Difference]: Start difference. First operand 5418 states and 6489 transitions. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 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 23:42:34,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:34,578 INFO L93 Difference]: Finished difference Result 14344 states and 17467 transitions. [2025-01-08 23:42:34,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:34,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 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 270 [2025-01-08 23:42:34,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:34,599 INFO L225 Difference]: With dead ends: 14344 [2025-01-08 23:42:34,599 INFO L226 Difference]: Without dead ends: 8928 [2025-01-08 23:42:34,606 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 23:42:34,606 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 284 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:34,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 132 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:42:34,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8928 states. [2025-01-08 23:42:34,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8928 to 8551. [2025-01-08 23:42:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8551 states, 8550 states have (on average 1.2022222222222223) internal successors, (10279), 8550 states have internal predecessors, (10279), 0 states have call successors, (0), 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 23:42:34,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8551 states to 8551 states and 10279 transitions. [2025-01-08 23:42:34,729 INFO L78 Accepts]: Start accepts. Automaton has 8551 states and 10279 transitions. Word has length 270 [2025-01-08 23:42:34,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:34,731 INFO L471 AbstractCegarLoop]: Abstraction has 8551 states and 10279 transitions. [2025-01-08 23:42:34,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 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 23:42:34,731 INFO L276 IsEmpty]: Start isEmpty. Operand 8551 states and 10279 transitions. [2025-01-08 23:42:34,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-08 23:42:34,735 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:34,735 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:42:34,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:42:34,735 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:34,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:34,736 INFO L85 PathProgramCache]: Analyzing trace with hash -561745609, now seen corresponding path program 1 times [2025-01-08 23:42:34,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:34,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588163601] [2025-01-08 23:42:34,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:34,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:34,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-08 23:42:34,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-08 23:42:34,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:34,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:34,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:34,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588163601] [2025-01-08 23:42:34,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588163601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:34,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:34,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:34,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394981061] [2025-01-08 23:42:34,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:34,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:34,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:34,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:34,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:34,902 INFO L87 Difference]: Start difference. First operand 8551 states and 10279 transitions. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 23:42:35,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:35,946 INFO L93 Difference]: Finished difference Result 25417 states and 30895 transitions. [2025-01-08 23:42:35,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:35,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 270 [2025-01-08 23:42:35,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:35,990 INFO L225 Difference]: With dead ends: 25417 [2025-01-08 23:42:35,990 INFO L226 Difference]: Without dead ends: 16868 [2025-01-08 23:42:35,999 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 23:42:36,000 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 269 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:36,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 92 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:42:36,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16868 states. [2025-01-08 23:42:36,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16868 to 16867. [2025-01-08 23:42:36,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16867 states, 16866 states have (on average 1.204019921736037) internal successors, (20307), 16866 states have internal predecessors, (20307), 0 states have call successors, (0), 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 23:42:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16867 states to 16867 states and 20307 transitions. [2025-01-08 23:42:36,172 INFO L78 Accepts]: Start accepts. Automaton has 16867 states and 20307 transitions. Word has length 270 [2025-01-08 23:42:36,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:36,172 INFO L471 AbstractCegarLoop]: Abstraction has 16867 states and 20307 transitions. [2025-01-08 23:42:36,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 23:42:36,173 INFO L276 IsEmpty]: Start isEmpty. Operand 16867 states and 20307 transitions. [2025-01-08 23:42:36,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-01-08 23:42:36,177 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:36,177 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 23:42:36,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:42:36,178 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:36,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:36,178 INFO L85 PathProgramCache]: Analyzing trace with hash -2052350490, now seen corresponding path program 1 times [2025-01-08 23:42:36,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:36,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049262364] [2025-01-08 23:42:36,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:36,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:36,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-01-08 23:42:36,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-01-08 23:42:36,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:36,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:36,346 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-08 23:42:36,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:36,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049262364] [2025-01-08 23:42:36,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049262364] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:36,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:36,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:36,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419165119] [2025-01-08 23:42:36,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:36,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:36,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:36,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:36,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:36,347 INFO L87 Difference]: Start difference. First operand 16867 states and 20307 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 23:42:37,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:37,188 INFO L93 Difference]: Finished difference Result 33558 states and 40443 transitions. [2025-01-08 23:42:37,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:37,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 277 [2025-01-08 23:42:37,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:37,242 INFO L225 Difference]: With dead ends: 33558 [2025-01-08 23:42:37,246 INFO L226 Difference]: Without dead ends: 16877 [2025-01-08 23:42:37,270 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 23:42:37,274 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 143 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:37,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 377 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:42:37,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16877 states. [2025-01-08 23:42:37,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16877 to 16866. [2025-01-08 23:42:37,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16866 states, 16865 states have (on average 1.1675066706196264) internal successors, (19690), 16865 states have internal predecessors, (19690), 0 states have call successors, (0), 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 23:42:37,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16866 states to 16866 states and 19690 transitions. [2025-01-08 23:42:37,596 INFO L78 Accepts]: Start accepts. Automaton has 16866 states and 19690 transitions. Word has length 277 [2025-01-08 23:42:37,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:37,596 INFO L471 AbstractCegarLoop]: Abstraction has 16866 states and 19690 transitions. [2025-01-08 23:42:37,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 23:42:37,597 INFO L276 IsEmpty]: Start isEmpty. Operand 16866 states and 19690 transitions. [2025-01-08 23:42:37,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-01-08 23:42:37,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:37,604 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:42:37,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:42:37,605 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:37,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:37,605 INFO L85 PathProgramCache]: Analyzing trace with hash -587526739, now seen corresponding path program 1 times [2025-01-08 23:42:37,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:37,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153751380] [2025-01-08 23:42:37,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:37,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:37,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-01-08 23:42:37,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-01-08 23:42:37,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:37,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:37,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:37,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153751380] [2025-01-08 23:42:37,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153751380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:37,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:37,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:37,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341201471] [2025-01-08 23:42:37,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:37,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:37,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:37,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:37,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:37,903 INFO L87 Difference]: Start difference. First operand 16866 states and 19690 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:38,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:38,752 INFO L93 Difference]: Finished difference Result 35938 states and 42299 transitions. [2025-01-08 23:42:38,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:38,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 291 [2025-01-08 23:42:38,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:38,781 INFO L225 Difference]: With dead ends: 35938 [2025-01-08 23:42:38,782 INFO L226 Difference]: Without dead ends: 18889 [2025-01-08 23:42:38,795 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 23:42:38,796 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 215 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:38,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 171 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:42:38,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18889 states. [2025-01-08 23:42:38,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18889 to 17584. [2025-01-08 23:42:38,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17584 states, 17583 states have (on average 1.129443212193596) internal successors, (19859), 17583 states have internal predecessors, (19859), 0 states have call successors, (0), 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 23:42:39,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17584 states to 17584 states and 19859 transitions. [2025-01-08 23:42:39,074 INFO L78 Accepts]: Start accepts. Automaton has 17584 states and 19859 transitions. Word has length 291 [2025-01-08 23:42:39,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:39,075 INFO L471 AbstractCegarLoop]: Abstraction has 17584 states and 19859 transitions. [2025-01-08 23:42:39,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:39,075 INFO L276 IsEmpty]: Start isEmpty. Operand 17584 states and 19859 transitions. [2025-01-08 23:42:39,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-01-08 23:42:39,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:39,083 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:42:39,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:42:39,083 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:39,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:39,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1831268552, now seen corresponding path program 1 times [2025-01-08 23:42:39,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:39,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342185660] [2025-01-08 23:42:39,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:39,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:39,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-08 23:42:39,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-08 23:42:39,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:39,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-01-08 23:42:39,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:39,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342185660] [2025-01-08 23:42:39,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342185660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:39,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:39,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:39,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779784698] [2025-01-08 23:42:39,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:39,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:39,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:39,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:39,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:39,206 INFO L87 Difference]: Start difference. First operand 17584 states and 19859 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 23:42:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:39,750 INFO L93 Difference]: Finished difference Result 36817 states and 41554 transitions. [2025-01-08 23:42:39,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:39,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 325 [2025-01-08 23:42:39,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:39,859 INFO L225 Difference]: With dead ends: 36817 [2025-01-08 23:42:39,860 INFO L226 Difference]: Without dead ends: 21631 [2025-01-08 23:42:39,866 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 23:42:39,867 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 164 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:39,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 148 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:39,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21631 states. [2025-01-08 23:42:39,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21631 to 13159. [2025-01-08 23:42:39,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13159 states, 13158 states have (on average 1.138014895880833) internal successors, (14974), 13158 states have internal predecessors, (14974), 0 states have call successors, (0), 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 23:42:40,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13159 states to 13159 states and 14974 transitions. [2025-01-08 23:42:40,002 INFO L78 Accepts]: Start accepts. Automaton has 13159 states and 14974 transitions. Word has length 325 [2025-01-08 23:42:40,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:40,002 INFO L471 AbstractCegarLoop]: Abstraction has 13159 states and 14974 transitions. [2025-01-08 23:42:40,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 23:42:40,003 INFO L276 IsEmpty]: Start isEmpty. Operand 13159 states and 14974 transitions. [2025-01-08 23:42:40,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-01-08 23:42:40,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:40,009 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:40,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:42:40,010 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:40,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:40,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1912574704, now seen corresponding path program 1 times [2025-01-08 23:42:40,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:40,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990884016] [2025-01-08 23:42:40,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:40,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:40,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-01-08 23:42:40,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-01-08 23:42:40,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:40,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:40,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:40,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990884016] [2025-01-08 23:42:40,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990884016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:40,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:40,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:40,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795242240] [2025-01-08 23:42:40,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:40,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:40,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:40,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:40,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:40,368 INFO L87 Difference]: Start difference. First operand 13159 states and 14974 transitions. Second operand has 4 states, 4 states have (on average 84.5) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 23:42:41,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:41,379 INFO L93 Difference]: Finished difference Result 31482 states and 35845 transitions. [2025-01-08 23:42:41,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:41,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.5) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 338 [2025-01-08 23:42:41,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:41,402 INFO L225 Difference]: With dead ends: 31482 [2025-01-08 23:42:41,402 INFO L226 Difference]: Without dead ends: 18325 [2025-01-08 23:42:41,413 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 23:42:41,414 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 159 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:41,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 125 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:42:41,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18325 states. [2025-01-08 23:42:41,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18325 to 17582. [2025-01-08 23:42:41,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17582 states, 17581 states have (on average 1.1327000739434616) internal successors, (19914), 17581 states have internal predecessors, (19914), 0 states have call successors, (0), 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 23:42:41,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17582 states to 17582 states and 19914 transitions. [2025-01-08 23:42:41,629 INFO L78 Accepts]: Start accepts. Automaton has 17582 states and 19914 transitions. Word has length 338 [2025-01-08 23:42:41,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:41,629 INFO L471 AbstractCegarLoop]: Abstraction has 17582 states and 19914 transitions. [2025-01-08 23:42:41,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.5) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 23:42:41,630 INFO L276 IsEmpty]: Start isEmpty. Operand 17582 states and 19914 transitions. [2025-01-08 23:42:41,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-01-08 23:42:41,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:41,637 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:42:41,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:42:41,637 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:41,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:41,638 INFO L85 PathProgramCache]: Analyzing trace with hash -2139187060, now seen corresponding path program 1 times [2025-01-08 23:42:41,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:41,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335197408] [2025-01-08 23:42:41,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:41,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:41,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-01-08 23:42:41,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-01-08 23:42:41,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:41,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 267 proven. 74 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:42:42,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:42,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335197408] [2025-01-08 23:42:42,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335197408] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:42:42,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57282746] [2025-01-08 23:42:42,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:42,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:42:42,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:42:42,209 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 23:42:42,214 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 23:42:42,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-01-08 23:42:42,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-01-08 23:42:42,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:42,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:42,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:42:42,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:42:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:42:42,828 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:42:42,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57282746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:42,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:42:42,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:42:42,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288298964] [2025-01-08 23:42:42,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:42,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:42,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:42,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:42,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-08 23:42:42,829 INFO L87 Difference]: Start difference. First operand 17582 states and 19914 transitions. Second operand has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 23:42:43,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:43,794 INFO L93 Difference]: Finished difference Result 40878 states and 46150 transitions. [2025-01-08 23:42:43,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:43,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 345 [2025-01-08 23:42:43,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:43,818 INFO L225 Difference]: With dead ends: 40878 [2025-01-08 23:42:43,819 INFO L226 Difference]: Without dead ends: 23666 [2025-01-08 23:42:43,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-08 23:42:43,831 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 294 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:43,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 155 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:42:43,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23666 states. [2025-01-08 23:42:44,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23666 to 22926. [2025-01-08 23:42:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22926 states, 22925 states have (on average 1.126019629225736) internal successors, (25814), 22925 states have internal predecessors, (25814), 0 states have call successors, (0), 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 23:42:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22926 states to 22926 states and 25814 transitions. [2025-01-08 23:42:44,134 INFO L78 Accepts]: Start accepts. Automaton has 22926 states and 25814 transitions. Word has length 345 [2025-01-08 23:42:44,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:44,134 INFO L471 AbstractCegarLoop]: Abstraction has 22926 states and 25814 transitions. [2025-01-08 23:42:44,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 23:42:44,135 INFO L276 IsEmpty]: Start isEmpty. Operand 22926 states and 25814 transitions. [2025-01-08 23:42:44,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-01-08 23:42:44,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:44,150 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:42:44,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 23:42:44,350 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,SelfDestructingSolverStorable13 [2025-01-08 23:42:44,351 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:44,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:44,352 INFO L85 PathProgramCache]: Analyzing trace with hash -5255565, now seen corresponding path program 1 times [2025-01-08 23:42:44,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:44,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751186768] [2025-01-08 23:42:44,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:44,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:44,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-01-08 23:42:44,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-01-08 23:42:44,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:44,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-01-08 23:42:44,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:44,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751186768] [2025-01-08 23:42:44,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751186768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:44,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:44,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 23:42:44,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034138406] [2025-01-08 23:42:44,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:44,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 23:42:44,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:44,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 23:42:44,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:42:44,705 INFO L87 Difference]: Start difference. First operand 22926 states and 25814 transitions. Second operand has 7 states, 7 states have (on average 39.57142857142857) internal successors, (277), 6 states have internal predecessors, (277), 0 states have call successors, (0), 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 23:42:45,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:45,222 INFO L93 Difference]: Finished difference Result 43993 states and 49567 transitions. [2025-01-08 23:42:45,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 23:42:45,222 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.57142857142857) internal successors, (277), 6 states have internal predecessors, (277), 0 states have call successors, (0), 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 362 [2025-01-08 23:42:45,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:45,240 INFO L225 Difference]: With dead ends: 43993 [2025-01-08 23:42:45,240 INFO L226 Difference]: Without dead ends: 21065 [2025-01-08 23:42:45,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:42:45,254 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 214 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:45,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 70 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:42:45,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21065 states. [2025-01-08 23:42:45,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21065 to 21054. [2025-01-08 23:42:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21054 states, 21053 states have (on average 1.124352823825583) internal successors, (23671), 21053 states have internal predecessors, (23671), 0 states have call successors, (0), 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 23:42:45,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21054 states to 21054 states and 23671 transitions. [2025-01-08 23:42:45,477 INFO L78 Accepts]: Start accepts. Automaton has 21054 states and 23671 transitions. Word has length 362 [2025-01-08 23:42:45,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:45,477 INFO L471 AbstractCegarLoop]: Abstraction has 21054 states and 23671 transitions. [2025-01-08 23:42:45,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.57142857142857) internal successors, (277), 6 states have internal predecessors, (277), 0 states have call successors, (0), 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 23:42:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 21054 states and 23671 transitions. [2025-01-08 23:42:45,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-01-08 23:42:45,484 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:45,485 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:42:45,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:42:45,485 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:45,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:45,485 INFO L85 PathProgramCache]: Analyzing trace with hash 424792775, now seen corresponding path program 1 times [2025-01-08 23:42:45,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:45,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918799590] [2025-01-08 23:42:45,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:45,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:45,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-01-08 23:42:45,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-01-08 23:42:45,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:45,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:45,758 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-08 23:42:45,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:45,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918799590] [2025-01-08 23:42:45,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918799590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:45,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:45,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:42:45,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263172858] [2025-01-08 23:42:45,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:45,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:45,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:45,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:45,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:45,759 INFO L87 Difference]: Start difference. First operand 21054 states and 23671 transitions. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 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 23:42:46,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:46,832 INFO L93 Difference]: Finished difference Result 44691 states and 50354 transitions. [2025-01-08 23:42:46,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:46,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 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 367 [2025-01-08 23:42:46,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:46,857 INFO L225 Difference]: With dead ends: 44691 [2025-01-08 23:42:46,857 INFO L226 Difference]: Without dead ends: 24371 [2025-01-08 23:42:46,868 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 23:42:46,868 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 271 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:46,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 352 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:42:46,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24371 states. [2025-01-08 23:42:47,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24371 to 20675. [2025-01-08 23:42:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20675 states, 20674 states have (on average 1.0981425945632195) internal successors, (22703), 20674 states have internal predecessors, (22703), 0 states have call successors, (0), 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 23:42:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20675 states to 20675 states and 22703 transitions. [2025-01-08 23:42:47,124 INFO L78 Accepts]: Start accepts. Automaton has 20675 states and 22703 transitions. Word has length 367 [2025-01-08 23:42:47,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:47,124 INFO L471 AbstractCegarLoop]: Abstraction has 20675 states and 22703 transitions. [2025-01-08 23:42:47,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 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 23:42:47,125 INFO L276 IsEmpty]: Start isEmpty. Operand 20675 states and 22703 transitions. [2025-01-08 23:42:47,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-01-08 23:42:47,140 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:47,140 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:42:47,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 23:42:47,140 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:47,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:47,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1491541504, now seen corresponding path program 1 times [2025-01-08 23:42:47,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:47,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775204395] [2025-01-08 23:42:47,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:47,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:47,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-01-08 23:42:47,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-01-08 23:42:47,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:47,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 154 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:47,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:47,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775204395] [2025-01-08 23:42:47,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775204395] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:42:47,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559473316] [2025-01-08 23:42:47,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:47,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:42:47,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:42:47,987 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 23:42:47,989 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 23:42:48,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-01-08 23:42:48,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-01-08 23:42:48,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:48,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:48,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 23:42:48,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:42:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 154 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:49,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:42:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 257 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:51,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559473316] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:42:51,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:42:51,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-08 23:42:51,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743308409] [2025-01-08 23:42:51,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:42:51,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-08 23:42:51,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:51,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-08 23:42:51,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-01-08 23:42:51,950 INFO L87 Difference]: Start difference. First operand 20675 states and 22703 transitions. Second operand has 13 states, 13 states have (on average 104.0) internal successors, (1352), 12 states have internal predecessors, (1352), 0 states have call successors, (0), 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 23:42:55,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:55,909 INFO L93 Difference]: Finished difference Result 46323 states and 50897 transitions. [2025-01-08 23:42:55,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-08 23:42:55,909 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 104.0) internal successors, (1352), 12 states have internal predecessors, (1352), 0 states have call successors, (0), 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 470 [2025-01-08 23:42:55,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:55,926 INFO L225 Difference]: With dead ends: 46323 [2025-01-08 23:42:55,927 INFO L226 Difference]: Without dead ends: 25834 [2025-01-08 23:42:55,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 932 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2025-01-08 23:42:55,932 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1184 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 6466 mSolverCounterSat, 413 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 6879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 413 IncrementalHoareTripleChecker+Valid, 6466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:55,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 224 Invalid, 6879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [413 Valid, 6466 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-08 23:42:55,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25834 states. [2025-01-08 23:42:56,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25834 to 21043. [2025-01-08 23:42:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21043 states, 21042 states have (on average 1.0936222792510217) internal successors, (23012), 21042 states have internal predecessors, (23012), 0 states have call successors, (0), 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 23:42:56,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21043 states to 21043 states and 23012 transitions. [2025-01-08 23:42:56,104 INFO L78 Accepts]: Start accepts. Automaton has 21043 states and 23012 transitions. Word has length 470 [2025-01-08 23:42:56,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:56,104 INFO L471 AbstractCegarLoop]: Abstraction has 21043 states and 23012 transitions. [2025-01-08 23:42:56,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 104.0) internal successors, (1352), 12 states have internal predecessors, (1352), 0 states have call successors, (0), 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 23:42:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 21043 states and 23012 transitions. [2025-01-08 23:42:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2025-01-08 23:42:56,121 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:56,121 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:42:56,127 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 23:42:56,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-08 23:42:56,322 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:56,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:56,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1116214418, now seen corresponding path program 1 times [2025-01-08 23:42:56,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:56,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506691388] [2025-01-08 23:42:56,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:56,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:56,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 556 statements into 1 equivalence classes. [2025-01-08 23:42:56,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 556 of 556 statements. [2025-01-08 23:42:56,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:56,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:56,543 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 510 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2025-01-08 23:42:56,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:56,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506691388] [2025-01-08 23:42:56,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506691388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:56,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:56,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:56,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51734112] [2025-01-08 23:42:56,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:56,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:56,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:56,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:56,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:56,544 INFO L87 Difference]: Start difference. First operand 21043 states and 23012 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 23:42:57,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:57,078 INFO L93 Difference]: Finished difference Result 40261 states and 44028 transitions. [2025-01-08 23:42:57,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:57,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 556 [2025-01-08 23:42:57,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:57,120 INFO L225 Difference]: With dead ends: 40261 [2025-01-08 23:42:57,120 INFO L226 Difference]: Without dead ends: 21430 [2025-01-08 23:42:57,132 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 23:42:57,132 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 105 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:57,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 125 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:42:57,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21430 states. [2025-01-08 23:42:57,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21430 to 15151. [2025-01-08 23:42:57,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15151 states, 15150 states have (on average 1.0912211221122112) internal successors, (16532), 15150 states have internal predecessors, (16532), 0 states have call successors, (0), 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 23:42:57,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15151 states to 15151 states and 16532 transitions. [2025-01-08 23:42:57,285 INFO L78 Accepts]: Start accepts. Automaton has 15151 states and 16532 transitions. Word has length 556 [2025-01-08 23:42:57,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:57,285 INFO L471 AbstractCegarLoop]: Abstraction has 15151 states and 16532 transitions. [2025-01-08 23:42:57,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 23:42:57,285 INFO L276 IsEmpty]: Start isEmpty. Operand 15151 states and 16532 transitions. [2025-01-08 23:42:57,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-01-08 23:42:57,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:57,294 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:57,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 23:42:57,298 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:57,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:57,298 INFO L85 PathProgramCache]: Analyzing trace with hash -740134884, now seen corresponding path program 1 times [2025-01-08 23:42:57,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:57,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590224865] [2025-01-08 23:42:57,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:57,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:57,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-01-08 23:42:57,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-01-08 23:42:57,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:57,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:57,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2025-01-08 23:42:57,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:57,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590224865] [2025-01-08 23:42:57,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590224865] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:57,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:57,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:57,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639146290] [2025-01-08 23:42:57,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:57,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:57,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:57,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:57,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:57,456 INFO L87 Difference]: Start difference. First operand 15151 states and 16532 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 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 23:42:57,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:57,988 INFO L93 Difference]: Finished difference Result 30848 states and 33621 transitions. [2025-01-08 23:42:57,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:57,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 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 575 [2025-01-08 23:42:57,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:58,003 INFO L225 Difference]: With dead ends: 30848 [2025-01-08 23:42:58,003 INFO L226 Difference]: Without dead ends: 16067 [2025-01-08 23:42:58,012 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 23:42:58,012 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 100 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:58,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 130 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16067 states. [2025-01-08 23:42:58,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16067 to 14959. [2025-01-08 23:42:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14959 states, 14958 states have (on average 1.0832999064045996) internal successors, (16204), 14958 states have internal predecessors, (16204), 0 states have call successors, (0), 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 23:42:58,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14959 states to 14959 states and 16204 transitions. [2025-01-08 23:42:58,144 INFO L78 Accepts]: Start accepts. Automaton has 14959 states and 16204 transitions. Word has length 575 [2025-01-08 23:42:58,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:58,144 INFO L471 AbstractCegarLoop]: Abstraction has 14959 states and 16204 transitions. [2025-01-08 23:42:58,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 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 23:42:58,144 INFO L276 IsEmpty]: Start isEmpty. Operand 14959 states and 16204 transitions. [2025-01-08 23:42:58,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2025-01-08 23:42:58,153 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:58,154 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:42:58,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-08 23:42:58,154 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:58,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:58,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1144048792, now seen corresponding path program 1 times [2025-01-08 23:42:58,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:58,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171718748] [2025-01-08 23:42:58,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:58,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:58,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 625 statements into 1 equivalence classes. [2025-01-08 23:42:58,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 625 of 625 statements. [2025-01-08 23:42:58,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:58,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 762 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-01-08 23:42:58,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:58,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171718748] [2025-01-08 23:42:58,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171718748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:58,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:58,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:58,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852192274] [2025-01-08 23:42:58,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:58,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:58,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:58,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:58,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:58,345 INFO L87 Difference]: Start difference. First operand 14959 states and 16204 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 23:42:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:58,857 INFO L93 Difference]: Finished difference Result 28255 states and 30588 transitions. [2025-01-08 23:42:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:58,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 625 [2025-01-08 23:42:58,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:58,869 INFO L225 Difference]: With dead ends: 28255 [2025-01-08 23:42:58,873 INFO L226 Difference]: Without dead ends: 13850 [2025-01-08 23:42:58,882 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 23:42:58,882 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 190 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:58,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 316 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:42:58,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13850 states. [2025-01-08 23:42:58,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13850 to 13850. [2025-01-08 23:42:58,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13850 states, 13849 states have (on average 1.0756011264351217) internal successors, (14896), 13849 states have internal predecessors, (14896), 0 states have call successors, (0), 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 23:42:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13850 states to 13850 states and 14896 transitions. [2025-01-08 23:42:58,990 INFO L78 Accepts]: Start accepts. Automaton has 13850 states and 14896 transitions. Word has length 625 [2025-01-08 23:42:58,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:58,990 INFO L471 AbstractCegarLoop]: Abstraction has 13850 states and 14896 transitions. [2025-01-08 23:42:58,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 23:42:58,990 INFO L276 IsEmpty]: Start isEmpty. Operand 13850 states and 14896 transitions. [2025-01-08 23:42:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2025-01-08 23:42:59,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:59,012 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:42:59,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-08 23:42:59,013 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:59,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:59,013 INFO L85 PathProgramCache]: Analyzing trace with hash 73450175, now seen corresponding path program 1 times [2025-01-08 23:42:59,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:59,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773760747] [2025-01-08 23:42:59,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:59,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:59,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 708 statements into 1 equivalence classes. [2025-01-08 23:42:59,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 708 of 708 statements. [2025-01-08 23:42:59,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:59,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1695 backedges. 1124 proven. 0 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2025-01-08 23:42:59,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:59,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773760747] [2025-01-08 23:42:59,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773760747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:59,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:59,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:59,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617243769] [2025-01-08 23:42:59,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:59,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:59,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:59,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:59,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:59,209 INFO L87 Difference]: Start difference. First operand 13850 states and 14896 transitions. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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 23:42:59,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:59,608 INFO L93 Difference]: Finished difference Result 27327 states and 29360 transitions. [2025-01-08 23:42:59,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:59,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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 708 [2025-01-08 23:42:59,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:59,610 INFO L225 Difference]: With dead ends: 27327 [2025-01-08 23:42:59,610 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:42:59,617 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 23:42:59,618 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 52 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:59,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 306 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:42:59,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:42:59,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:42:59,619 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 23:42:59,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:42:59,619 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 708 [2025-01-08 23:42:59,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:59,619 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:42:59,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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 23:42:59,620 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:42:59,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:42:59,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:42:59,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 23:42:59,624 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:59,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:43:04,600 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:43:04,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:43:04 BoogieIcfgContainer [2025-01-08 23:43:04,629 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:43:04,630 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:43:04,630 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:43:04,630 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:43:04,631 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:42:25" (3/4) ... [2025-01-08 23:43:04,632 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:43:04,653 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:43:04,654 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:43:04,655 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:43:04,656 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:43:04,769 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:43:04,769 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:43:04,769 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:43:04,770 INFO L158 Benchmark]: Toolchain (without parser) took 40978.56ms. Allocated memory was 201.3MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 155.5MB in the beginning and 842.1MB in the end (delta: -686.5MB). Peak memory consumption was 682.4MB. Max. memory is 16.1GB. [2025-01-08 23:43:04,770 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 209.7MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:43:04,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.60ms. Allocated memory is still 201.3MB. Free memory was 155.5MB in the beginning and 112.0MB in the end (delta: 43.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-08 23:43:04,771 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.52ms. Allocated memory is still 201.3MB. Free memory was 112.0MB in the beginning and 95.1MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:43:04,772 INFO L158 Benchmark]: Boogie Preprocessor took 106.26ms. Allocated memory is still 201.3MB. Free memory was 95.1MB in the beginning and 70.3MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 23:43:04,772 INFO L158 Benchmark]: RCFGBuilder took 1308.68ms. Allocated memory is still 201.3MB. Free memory was 70.3MB in the beginning and 98.8MB in the end (delta: -28.5MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. [2025-01-08 23:43:04,774 INFO L158 Benchmark]: TraceAbstraction took 38934.05ms. Allocated memory was 201.3MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 97.5MB in the beginning and 858.7MB in the end (delta: -761.2MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-01-08 23:43:04,774 INFO L158 Benchmark]: Witness Printer took 138.98ms. Allocated memory is still 1.6GB. Free memory was 858.7MB in the beginning and 842.1MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:43:04,775 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.18ms. Allocated memory is still 209.7MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.60ms. Allocated memory is still 201.3MB. Free memory was 155.5MB in the beginning and 112.0MB in the end (delta: 43.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.52ms. Allocated memory is still 201.3MB. Free memory was 112.0MB in the beginning and 95.1MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.26ms. Allocated memory is still 201.3MB. Free memory was 95.1MB in the beginning and 70.3MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1308.68ms. Allocated memory is still 201.3MB. Free memory was 70.3MB in the beginning and 98.8MB in the end (delta: -28.5MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. * TraceAbstraction took 38934.05ms. Allocated memory was 201.3MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 97.5MB in the beginning and 858.7MB in the end (delta: -761.2MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 138.98ms. Allocated memory is still 1.6GB. Free memory was 858.7MB in the beginning and 842.1MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 190]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.9s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 19.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4785 SdHoareTripleChecker+Valid, 17.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4785 mSDsluCounter, 4531 SdHoareTripleChecker+Invalid, 14.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 752 mSDsCounter, 2550 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21036 IncrementalHoareTripleChecker+Invalid, 23586 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2550 mSolverCounterUnsat, 3779 mSDtfsCounter, 21036 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1359 GetRequests, 1306 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22926occurred in iteration=14, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 28495 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 7829 NumberOfCodeBlocks, 7829 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 8275 ConstructedInterpolants, 0 QuantifiedInterpolants, 34459 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1077 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 24 InterpolantComputations, 20 PerfectInterpolantSequences, 9321/10330 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: 1044]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((a29 <= 140) && (a3 == 1)) && (a8 == 15)) && (a25 == 10)) || (((((a29 <= 277) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || (((((a25 == 11) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) || (((((a25 == 11) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (130 <= a29))) || (((((((long long) a23 + 43) <= 0) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || (((((((long long) a23 + 43) <= 0) && (a29 <= 140)) && (a25 == 11)) && (a3 == 1)) && (a8 == 15))) || ((((((a29 <= 140) && (a25 == 9)) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((a25 == 12) && (((long long) a29 + 275824) <= 0)) && (a3 == 1)) && (a8 == 15))) || ((((((a25 == 12) && (a29 <= 277)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (130 <= a29))) || ((((((((a25 == 12) || (a25 < 11)) || (a25 == 11)) && (((long long) a29 + 193244) <= 0)) && (a3 == 1)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15))) || ((((((long long) a23 + 127601) <= 0) && (a25 == 11)) && (a3 == 1)) && (a8 == 15))) || ((((a25 == 9) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a25 == 13) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || (((((a29 <= 275) && (a25 == 12)) && (a3 == 1)) && (a8 == 15)) && (130 <= a29))) || (((((a25 == 12) && (a23 <= 262)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a25 == 13) && ((a23 < 307) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 138096))) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((a25 == 9) && (a4 == 1)) && (a29 <= 130))) || (((((a25 == 12) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || (((((((long long) a23 + 127601) <= 0) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((a25 == 9) && (((long long) a23 + 599772) <= 0)) && (a4 == 1))) || (((((((long long) a23 + 43) <= 0) && (a25 == 9)) && (a3 == 1)) && (a8 == 15)) && (130 <= a29))) || ((((((a25 <= 10) && (a23 <= 262)) && (a3 == 1)) && (a29 <= 220)) && (a4 == 1)) && (a8 == 15))) || (((((307 <= a23) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || (((((((long long) a23 + 43) <= 0) && (((long long) a29 + 275824) <= 0)) && (a25 == 9)) && (a3 == 1)) && (a8 == 15))) || (((((((300138 <= a29) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 483831))) || ((((a25 == 12) && (((long long) a23 + 127601) <= 0)) && (a3 == 1)) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:43:04,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE