./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label32.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label32.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b831aa366302fa2c77135b486d8b7f29aa8c9f7f58e6c2271aafe7f88b79748 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:55:20,853 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:55:20,910 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:55:20,915 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:55:20,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:55:20,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:55:20,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:55:20,934 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:55:20,934 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:55:20,934 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:55:20,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:55:20,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:55:20,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:55:20,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:55:20,934 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:55:20,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:55:20,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:55:20,935 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:55:20,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:55:20,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:55:20,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:55:20,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:55:20,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:55:20,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:55:20,935 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:55:20,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:55:20,935 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:55:20,935 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:55:20,935 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:55:20,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:55:20,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:55:20,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:55:20,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:55:20,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:55:20,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:55:20,935 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:55:20,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:55:20,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:55:20,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:55:20,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:55:20,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:55:20,936 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:55:20,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:55:20,936 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7b831aa366302fa2c77135b486d8b7f29aa8c9f7f58e6c2271aafe7f88b79748 [2025-03-03 10:55:21,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:55:21,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:55:21,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:55:21,174 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:55:21,175 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:55:21,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label32.c [2025-03-03 10:55:22,341 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dfbb352f/f865a31377974d8395980c69c53e3f98/FLAGe3bbb5607 [2025-03-03 10:55:22,688 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:55:22,690 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label32.c [2025-03-03 10:55:22,705 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dfbb352f/f865a31377974d8395980c69c53e3f98/FLAGe3bbb5607 [2025-03-03 10:55:22,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dfbb352f/f865a31377974d8395980c69c53e3f98 [2025-03-03 10:55:22,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:55:22,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:55:22,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:55:22,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:55:22,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:55:22,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:55:22" (1/1) ... [2025-03-03 10:55:22,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7059a94d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:22, skipping insertion in model container [2025-03-03 10:55:22,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:55:22" (1/1) ... [2025-03-03 10:55:22,974 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:55:23,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label32.c[5121,5134] [2025-03-03 10:55:23,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:55:23,449 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:55:23,465 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label32.c[5121,5134] [2025-03-03 10:55:23,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:55:23,580 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:55:23,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23 WrapperNode [2025-03-03 10:55:23,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:55:23,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:55:23,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:55:23,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:55:23,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (1/1) ... [2025-03-03 10:55:23,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (1/1) ... [2025-03-03 10:55:23,705 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-03 10:55:23,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:55:23,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:55:23,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:55:23,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:55:23,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (1/1) ... [2025-03-03 10:55:23,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (1/1) ... [2025-03-03 10:55:23,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (1/1) ... [2025-03-03 10:55:23,804 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:55:23,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (1/1) ... [2025-03-03 10:55:23,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (1/1) ... [2025-03-03 10:55:23,834 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (1/1) ... [2025-03-03 10:55:23,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (1/1) ... [2025-03-03 10:55:23,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (1/1) ... [2025-03-03 10:55:23,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (1/1) ... [2025-03-03 10:55:23,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:55:23,863 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:55:23,863 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:55:23,863 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:55:23,864 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (1/1) ... [2025-03-03 10:55:23,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:55:23,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:55:23,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:55:23,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:55:23,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:55:23,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:55:23,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:55:23,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:55:23,963 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:55:23,964 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:55:25,551 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-03 10:55:25,627 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-03 10:55:25,627 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:55:25,641 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:55:25,645 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:55:25,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:55:25 BoogieIcfgContainer [2025-03-03 10:55:25,646 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:55:25,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:55:25,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:55:25,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:55:25,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:55:22" (1/3) ... [2025-03-03 10:55:25,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3a4b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:55:25, skipping insertion in model container [2025-03-03 10:55:25,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (2/3) ... [2025-03-03 10:55:25,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3a4b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:55:25, skipping insertion in model container [2025-03-03 10:55:25,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:55:25" (3/3) ... [2025-03-03 10:55:25,652 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label32.c [2025-03-03 10:55:25,664 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:55:25,666 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label32.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:55:25,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:55:25,736 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;@ac40870, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:55:25,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:55:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:25,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 10:55:25,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:25,748 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] [2025-03-03 10:55:25,748 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:25,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:25,752 INFO L85 PathProgramCache]: Analyzing trace with hash 43168191, now seen corresponding path program 1 times [2025-03-03 10:55:25,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:25,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236716784] [2025-03-03 10:55:25,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:25,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:25,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 10:55:25,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 10:55:25,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:25,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55: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-03-03 10:55:26,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:26,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236716784] [2025-03-03 10:55:26,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236716784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:26,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:26,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:55:26,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028075171] [2025-03-03 10:55:26,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:26,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:26,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:26,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:26,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:26,066 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:27,313 INFO L93 Difference]: Finished difference Result 1122 states and 2100 transitions. [2025-03-03 10:55:27,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:27,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-03-03 10:55:27,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:27,324 INFO L225 Difference]: With dead ends: 1122 [2025-03-03 10:55:27,324 INFO L226 Difference]: Without dead ends: 662 [2025-03-03 10:55:27,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:27,329 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 339 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:27,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 254 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:55:27,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-03 10:55:27,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-03-03 10:55:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.518910741301059) internal successors, (1004), 661 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1004 transitions. [2025-03-03 10:55:27,386 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1004 transitions. Word has length 48 [2025-03-03 10:55:27,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:27,388 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1004 transitions. [2025-03-03 10:55:27,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1004 transitions. [2025-03-03 10:55:27,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 10:55:27,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:27,394 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:27,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:55:27,395 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:27,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:27,395 INFO L85 PathProgramCache]: Analyzing trace with hash -729896949, now seen corresponding path program 1 times [2025-03-03 10:55:27,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:27,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130820554] [2025-03-03 10:55:27,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:27,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:27,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 10:55:27,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 10:55:27,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:27,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:27,759 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:55:27,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:27,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130820554] [2025-03-03 10:55:27,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130820554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:27,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:27,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:27,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587101947] [2025-03-03 10:55:27,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:27,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:55:27,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:27,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:55:27,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:55:27,762 INFO L87 Difference]: Start difference. First operand 662 states and 1004 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:29,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:29,307 INFO L93 Difference]: Finished difference Result 2309 states and 3414 transitions. [2025-03-03 10:55:29,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:55:29,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-03-03 10:55:29,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:29,313 INFO L225 Difference]: With dead ends: 2309 [2025-03-03 10:55:29,313 INFO L226 Difference]: Without dead ends: 1649 [2025-03-03 10:55:29,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:55:29,317 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1008 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:29,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 42 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 10:55:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2025-03-03 10:55:29,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2025-03-03 10:55:29,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1648 states have (on average 1.4016990291262137) internal successors, (2310), 1648 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:29,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2310 transitions. [2025-03-03 10:55:29,350 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2310 transitions. Word has length 116 [2025-03-03 10:55:29,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:29,350 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2310 transitions. [2025-03-03 10:55:29,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:29,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2310 transitions. [2025-03-03 10:55:29,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 10:55:29,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:29,358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:29,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:55:29,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:29,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:29,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1202382957, now seen corresponding path program 1 times [2025-03-03 10:55:29,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:29,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634725129] [2025-03-03 10:55:29,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:29,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:29,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 10:55:29,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 10:55:29,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:29,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:29,533 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:55:29,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:29,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634725129] [2025-03-03 10:55:29,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634725129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:29,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:29,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:55:29,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856128171] [2025-03-03 10:55:29,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:29,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:29,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:29,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:29,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:29,535 INFO L87 Difference]: Start difference. First operand 1649 states and 2310 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:30,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:30,569 INFO L93 Difference]: Finished difference Result 3625 states and 5242 transitions. [2025-03-03 10:55:30,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:30,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 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 179 [2025-03-03 10:55:30,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:30,579 INFO L225 Difference]: With dead ends: 3625 [2025-03-03 10:55:30,579 INFO L226 Difference]: Without dead ends: 2307 [2025-03-03 10:55:30,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:30,581 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:30,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 77 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:55:30,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-03-03 10:55:30,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-03-03 10:55:30,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.349956634865568) internal successors, (3113), 2306 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:30,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3113 transitions. [2025-03-03 10:55:30,618 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3113 transitions. Word has length 179 [2025-03-03 10:55:30,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:30,619 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3113 transitions. [2025-03-03 10:55:30,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:30,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3113 transitions. [2025-03-03 10:55:30,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-03 10:55:30,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:30,625 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:30,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:55:30,626 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:30,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:30,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2005907539, now seen corresponding path program 1 times [2025-03-03 10:55:30,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:30,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086400021] [2025-03-03 10:55:30,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:30,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:30,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 10:55:30,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 10:55:30,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:30,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 10:55:30,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:30,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086400021] [2025-03-03 10:55:30,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086400021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:30,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:30,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:55:30,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691688993] [2025-03-03 10:55:30,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:30,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:30,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:30,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:30,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:30,797 INFO L87 Difference]: Start difference. First operand 2307 states and 3113 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:31,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:31,771 INFO L93 Difference]: Finished difference Result 5599 states and 7699 transitions. [2025-03-03 10:55:31,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:31,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 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 214 [2025-03-03 10:55:31,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:31,781 INFO L225 Difference]: With dead ends: 5599 [2025-03-03 10:55:31,782 INFO L226 Difference]: Without dead ends: 3623 [2025-03-03 10:55:31,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:31,784 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:31,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:55:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2025-03-03 10:55:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 2965. [2025-03-03 10:55:31,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2964 states have (on average 1.2442645074224021) internal successors, (3688), 2964 states have internal predecessors, (3688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3688 transitions. [2025-03-03 10:55:31,824 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 3688 transitions. Word has length 214 [2025-03-03 10:55:31,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:31,825 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 3688 transitions. [2025-03-03 10:55:31,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 3688 transitions. [2025-03-03 10:55:31,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-03 10:55:31,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:31,827 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:31,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:55:31,827 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:31,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:31,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1672083745, now seen corresponding path program 1 times [2025-03-03 10:55:31,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:31,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041421217] [2025-03-03 10:55:31,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:31,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:31,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-03 10:55:31,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-03 10:55:31,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:31,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:55:31,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:31,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041421217] [2025-03-03 10:55:31,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041421217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:31,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:31,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:31,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180276162] [2025-03-03 10:55:31,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:31,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:31,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:31,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:31,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:31,962 INFO L87 Difference]: Start difference. First operand 2965 states and 3688 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:32,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:32,837 INFO L93 Difference]: Finished difference Result 6915 states and 8657 transitions. [2025-03-03 10:55:32,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:32,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231 [2025-03-03 10:55:32,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:32,845 INFO L225 Difference]: With dead ends: 6915 [2025-03-03 10:55:32,845 INFO L226 Difference]: Without dead ends: 3623 [2025-03-03 10:55:32,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:32,848 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 286 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:32,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 540 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:55:32,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2025-03-03 10:55:32,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3623. [2025-03-03 10:55:32,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3623 states, 3622 states have (on average 1.0762009939260078) internal successors, (3898), 3622 states have internal predecessors, (3898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:32,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 3898 transitions. [2025-03-03 10:55:32,910 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 3898 transitions. Word has length 231 [2025-03-03 10:55:32,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:32,910 INFO L471 AbstractCegarLoop]: Abstraction has 3623 states and 3898 transitions. [2025-03-03 10:55:32,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:32,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 3898 transitions. [2025-03-03 10:55:32,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-03-03 10:55:32,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:32,912 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:32,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:55:32,913 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:32,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:32,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1533178519, now seen corresponding path program 1 times [2025-03-03 10:55:32,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:32,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738907802] [2025-03-03 10:55:32,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:32,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:32,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-03 10:55:32,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-03 10:55:32,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:32,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:33,110 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:55:33,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:33,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738907802] [2025-03-03 10:55:33,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738907802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:33,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:33,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:33,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954693229] [2025-03-03 10:55:33,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:33,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:33,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:33,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:33,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:33,115 INFO L87 Difference]: Start difference. First operand 3623 states and 3898 transitions. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:33,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:33,892 INFO L93 Difference]: Finished difference Result 8231 states and 8905 transitions. [2025-03-03 10:55:33,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:33,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 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 283 [2025-03-03 10:55:33,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:33,902 INFO L225 Difference]: With dead ends: 8231 [2025-03-03 10:55:33,902 INFO L226 Difference]: Without dead ends: 4939 [2025-03-03 10:55:33,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:33,906 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 288 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:33,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 419 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:55:33,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2025-03-03 10:55:33,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4939. [2025-03-03 10:55:33,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4939 states, 4938 states have (on average 1.0514378290805995) internal successors, (5192), 4938 states have internal predecessors, (5192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:33,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 5192 transitions. [2025-03-03 10:55:33,963 INFO L78 Accepts]: Start accepts. Automaton has 4939 states and 5192 transitions. Word has length 283 [2025-03-03 10:55:33,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:33,963 INFO L471 AbstractCegarLoop]: Abstraction has 4939 states and 5192 transitions. [2025-03-03 10:55:33,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:33,964 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 5192 transitions. [2025-03-03 10:55:33,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-03-03 10:55:33,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:33,967 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:33,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:55:33,967 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:33,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:33,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1508487323, now seen corresponding path program 1 times [2025-03-03 10:55:33,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:33,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431730408] [2025-03-03 10:55:33,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:33,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:33,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-03-03 10:55:34,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-03-03 10:55:34,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:34,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:34,221 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 10:55:34,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:34,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431730408] [2025-03-03 10:55:34,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431730408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:34,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:34,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:34,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992075076] [2025-03-03 10:55:34,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:34,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:34,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:34,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:34,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:34,224 INFO L87 Difference]: Start difference. First operand 4939 states and 5192 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:34,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:34,889 INFO L93 Difference]: Finished difference Result 10863 states and 11493 transitions. [2025-03-03 10:55:34,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:34,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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 387 [2025-03-03 10:55:34,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:34,902 INFO L225 Difference]: With dead ends: 10863 [2025-03-03 10:55:34,903 INFO L226 Difference]: Without dead ends: 6255 [2025-03-03 10:55:34,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:34,907 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 300 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:34,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 38 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:55:34,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6255 states. [2025-03-03 10:55:34,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6255 to 6255. [2025-03-03 10:55:34,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6255 states, 6254 states have (on average 1.0548448992644708) internal successors, (6597), 6254 states have internal predecessors, (6597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:34,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 6597 transitions. [2025-03-03 10:55:34,988 INFO L78 Accepts]: Start accepts. Automaton has 6255 states and 6597 transitions. Word has length 387 [2025-03-03 10:55:34,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:34,989 INFO L471 AbstractCegarLoop]: Abstraction has 6255 states and 6597 transitions. [2025-03-03 10:55:34,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:34,989 INFO L276 IsEmpty]: Start isEmpty. Operand 6255 states and 6597 transitions. [2025-03-03 10:55:34,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-03-03 10:55:34,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:34,993 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:34,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:55:34,994 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:34,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:34,994 INFO L85 PathProgramCache]: Analyzing trace with hash 983844660, now seen corresponding path program 1 times [2025-03-03 10:55:34,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:34,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566451001] [2025-03-03 10:55:34,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:34,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:35,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-03 10:55:35,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-03 10:55:35,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:35,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-03 10:55:35,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:35,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566451001] [2025-03-03 10:55:35,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566451001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:35,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:35,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:35,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238865690] [2025-03-03 10:55:35,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:35,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:35,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:35,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:35,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:35,318 INFO L87 Difference]: Start difference. First operand 6255 states and 6597 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:36,022 INFO L93 Difference]: Finished difference Result 13495 states and 14303 transitions. [2025-03-03 10:55:36,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:36,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 441 [2025-03-03 10:55:36,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:36,047 INFO L225 Difference]: With dead ends: 13495 [2025-03-03 10:55:36,047 INFO L226 Difference]: Without dead ends: 7571 [2025-03-03 10:55:36,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:36,054 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 284 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:36,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 438 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:55:36,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2025-03-03 10:55:36,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7571. [2025-03-03 10:55:36,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7571 states, 7570 states have (on average 1.0498018494055483) internal successors, (7947), 7570 states have internal predecessors, (7947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:36,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 7947 transitions. [2025-03-03 10:55:36,164 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 7947 transitions. Word has length 441 [2025-03-03 10:55:36,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:36,165 INFO L471 AbstractCegarLoop]: Abstraction has 7571 states and 7947 transitions. [2025-03-03 10:55:36,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:36,166 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 7947 transitions. [2025-03-03 10:55:36,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-03-03 10:55:36,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:36,173 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:55:36,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:55:36,173 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:36,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:36,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1428886617, now seen corresponding path program 1 times [2025-03-03 10:55:36,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:36,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796850839] [2025-03-03 10:55:36,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:36,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:36,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-03 10:55:36,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-03 10:55:36,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:36,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:36,613 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2025-03-03 10:55:36,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:36,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796850839] [2025-03-03 10:55:36,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796850839] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:55:36,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827525290] [2025-03-03 10:55:36,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:36,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:55:36,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:55:36,617 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:55:36,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:55:36,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-03 10:55:36,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-03 10:55:36,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:36,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:36,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:55:36,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:55:37,293 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-03-03 10:55:37,294 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:55:37,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827525290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:37,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:55:37,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:55:37,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248318797] [2025-03-03 10:55:37,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:37,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:37,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:37,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:37,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:55:37,297 INFO L87 Difference]: Start difference. First operand 7571 states and 7947 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:37,922 INFO L93 Difference]: Finished difference Result 9218 states and 9631 transitions. [2025-03-03 10:55:37,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:37,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 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 502 [2025-03-03 10:55:37,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:37,939 INFO L225 Difference]: With dead ends: 9218 [2025-03-03 10:55:37,939 INFO L226 Difference]: Without dead ends: 9216 [2025-03-03 10:55:37,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:55:37,942 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 116 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:37,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 75 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:55:37,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2025-03-03 10:55:37,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 7900. [2025-03-03 10:55:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7900 states, 7899 states have (on average 1.0493733383972654) internal successors, (8289), 7899 states have internal predecessors, (8289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:38,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8289 transitions. [2025-03-03 10:55:38,015 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 8289 transitions. Word has length 502 [2025-03-03 10:55:38,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:38,015 INFO L471 AbstractCegarLoop]: Abstraction has 7900 states and 8289 transitions. [2025-03-03 10:55:38,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:38,016 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 8289 transitions. [2025-03-03 10:55:38,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1244 [2025-03-03 10:55:38,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:38,030 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:38,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:55:38,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:55:38,235 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:38,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:38,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1515827112, now seen corresponding path program 1 times [2025-03-03 10:55:38,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:38,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930859078] [2025-03-03 10:55:38,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:38,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:38,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1243 statements into 1 equivalence classes. [2025-03-03 10:55:38,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1243 of 1243 statements. [2025-03-03 10:55:38,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:38,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2824 backedges. 1965 proven. 0 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked. [2025-03-03 10:55:38,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:38,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930859078] [2025-03-03 10:55:38,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930859078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:38,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:38,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:38,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880404502] [2025-03-03 10:55:38,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:38,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:38,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:38,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:38,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:38,913 INFO L87 Difference]: Start difference. First operand 7900 states and 8289 transitions. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:39,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:39,509 INFO L93 Difference]: Finished difference Result 15469 states and 16245 transitions. [2025-03-03 10:55:39,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:39,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 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 1243 [2025-03-03 10:55:39,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:39,522 INFO L225 Difference]: With dead ends: 15469 [2025-03-03 10:55:39,522 INFO L226 Difference]: Without dead ends: 7900 [2025-03-03 10:55:39,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:39,528 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 222 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:39,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 427 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:55:39,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2025-03-03 10:55:39,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7900. [2025-03-03 10:55:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7900 states, 7899 states have (on average 1.0357007216103304) internal successors, (8181), 7899 states have internal predecessors, (8181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:39,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8181 transitions. [2025-03-03 10:55:39,582 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 8181 transitions. Word has length 1243 [2025-03-03 10:55:39,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:39,582 INFO L471 AbstractCegarLoop]: Abstraction has 7900 states and 8181 transitions. [2025-03-03 10:55:39,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 8181 transitions. [2025-03-03 10:55:39,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1245 [2025-03-03 10:55:39,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:39,618 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:39,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:55:39,618 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:39,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:39,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2117566772, now seen corresponding path program 1 times [2025-03-03 10:55:39,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:39,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267547607] [2025-03-03 10:55:39,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:39,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:39,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1244 statements into 1 equivalence classes. [2025-03-03 10:55:39,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1244 of 1244 statements. [2025-03-03 10:55:39,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:39,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:40,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2830 backedges. 1972 proven. 0 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2025-03-03 10:55:40,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:40,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267547607] [2025-03-03 10:55:40,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267547607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:40,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:40,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:40,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789204873] [2025-03-03 10:55:40,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:40,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:40,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:40,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:40,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:40,671 INFO L87 Difference]: Start difference. First operand 7900 states and 8181 transitions. Second operand has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:41,241 INFO L93 Difference]: Finished difference Result 15469 states and 16029 transitions. [2025-03-03 10:55:41,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:41,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1244 [2025-03-03 10:55:41,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:41,253 INFO L225 Difference]: With dead ends: 15469 [2025-03-03 10:55:41,253 INFO L226 Difference]: Without dead ends: 7900 [2025-03-03 10:55:41,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:41,261 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 210 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:41,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 37 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:55:41,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2025-03-03 10:55:41,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7900. [2025-03-03 10:55:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7900 states, 7899 states have (on average 1.0332953538422585) internal successors, (8162), 7899 states have internal predecessors, (8162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8162 transitions. [2025-03-03 10:55:41,337 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 8162 transitions. Word has length 1244 [2025-03-03 10:55:41,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:41,338 INFO L471 AbstractCegarLoop]: Abstraction has 7900 states and 8162 transitions. [2025-03-03 10:55:41,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:41,339 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 8162 transitions. [2025-03-03 10:55:41,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1273 [2025-03-03 10:55:41,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:41,362 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:41,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:55:41,363 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:41,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:41,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2091320016, now seen corresponding path program 1 times [2025-03-03 10:55:41,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:41,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620220298] [2025-03-03 10:55:41,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:41,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:41,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1272 statements into 1 equivalence classes. [2025-03-03 10:55:41,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1272 of 1272 statements. [2025-03-03 10:55:41,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:41,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:42,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2938 backedges. 1699 proven. 0 refuted. 0 times theorem prover too weak. 1239 trivial. 0 not checked. [2025-03-03 10:55:42,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:42,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620220298] [2025-03-03 10:55:42,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620220298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:42,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:42,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:42,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992642245] [2025-03-03 10:55:42,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:42,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:42,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:42,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:42,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:42,268 INFO L87 Difference]: Start difference. First operand 7900 states and 8162 transitions. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:42,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:42,809 INFO L93 Difference]: Finished difference Result 16785 states and 17326 transitions. [2025-03-03 10:55:42,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:42,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1272 [2025-03-03 10:55:42,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:42,821 INFO L225 Difference]: With dead ends: 16785 [2025-03-03 10:55:42,821 INFO L226 Difference]: Without dead ends: 9216 [2025-03-03 10:55:42,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:42,829 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:42,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 438 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:55:42,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2025-03-03 10:55:42,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 8887. [2025-03-03 10:55:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8887 states, 8886 states have (on average 1.0303848750844025) internal successors, (9156), 8886 states have internal predecessors, (9156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:42,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9156 transitions. [2025-03-03 10:55:42,960 INFO L78 Accepts]: Start accepts. Automaton has 8887 states and 9156 transitions. Word has length 1272 [2025-03-03 10:55:42,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:42,961 INFO L471 AbstractCegarLoop]: Abstraction has 8887 states and 9156 transitions. [2025-03-03 10:55:42,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:42,961 INFO L276 IsEmpty]: Start isEmpty. Operand 8887 states and 9156 transitions. [2025-03-03 10:55:42,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1291 [2025-03-03 10:55:42,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:42,975 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:42,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:55:42,976 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:42,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:42,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1394157249, now seen corresponding path program 1 times [2025-03-03 10:55:42,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:42,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085628210] [2025-03-03 10:55:42,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:42,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:43,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1290 statements into 1 equivalence classes. [2025-03-03 10:55:43,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1290 of 1290 statements. [2025-03-03 10:55:43,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:43,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2968 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 2647 trivial. 0 not checked. [2025-03-03 10:55:43,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:43,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085628210] [2025-03-03 10:55:43,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085628210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:43,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:43,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 10:55:43,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319241117] [2025-03-03 10:55:43,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:43,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 10:55:43,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:43,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 10:55:43,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:55:43,972 INFO L87 Difference]: Start difference. First operand 8887 states and 9156 transitions. Second operand has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:44,476 INFO L93 Difference]: Finished difference Result 17502 states and 18038 transitions. [2025-03-03 10:55:44,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 10:55:44,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 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 1290 [2025-03-03 10:55:44,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:44,490 INFO L225 Difference]: With dead ends: 17502 [2025-03-03 10:55:44,490 INFO L226 Difference]: Without dead ends: 8887 [2025-03-03 10:55:44,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:55:44,498 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 22 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:44,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 459 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:55:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8887 states. [2025-03-03 10:55:44,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8887. [2025-03-03 10:55:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8887 states, 8886 states have (on average 1.0297096556380825) internal successors, (9150), 8886 states have internal predecessors, (9150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:44,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9150 transitions. [2025-03-03 10:55:44,563 INFO L78 Accepts]: Start accepts. Automaton has 8887 states and 9150 transitions. Word has length 1290 [2025-03-03 10:55:44,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:44,564 INFO L471 AbstractCegarLoop]: Abstraction has 8887 states and 9150 transitions. [2025-03-03 10:55:44,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 8887 states and 9150 transitions. [2025-03-03 10:55:44,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1300 [2025-03-03 10:55:44,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:44,578 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:44,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:55:44,578 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:44,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:44,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1055344753, now seen corresponding path program 1 times [2025-03-03 10:55:44,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:44,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692199506] [2025-03-03 10:55:44,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:44,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:44,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1299 statements into 1 equivalence classes. [2025-03-03 10:55:44,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1299 of 1299 statements. [2025-03-03 10:55:44,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:44,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2959 backedges. 2140 proven. 0 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2025-03-03 10:55:45,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:45,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692199506] [2025-03-03 10:55:45,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692199506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:45,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:45,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 10:55:45,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917560688] [2025-03-03 10:55:45,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:45,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 10:55:45,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:45,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 10:55:45,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:55:45,605 INFO L87 Difference]: Start difference. First operand 8887 states and 9150 transitions. Second operand has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:46,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:46,356 INFO L93 Difference]: Finished difference Result 17444 states and 17968 transitions. [2025-03-03 10:55:46,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 10:55:46,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 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 1299 [2025-03-03 10:55:46,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:46,364 INFO L225 Difference]: With dead ends: 17444 [2025-03-03 10:55:46,364 INFO L226 Difference]: Without dead ends: 8888 [2025-03-03 10:55:46,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:55:46,370 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 505 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:46,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 558 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:55:46,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8888 states. [2025-03-03 10:55:46,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8888 to 8887. [2025-03-03 10:55:46,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8887 states, 8886 states have (on average 1.0289218996173757) internal successors, (9143), 8886 states have internal predecessors, (9143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:46,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9143 transitions. [2025-03-03 10:55:46,425 INFO L78 Accepts]: Start accepts. Automaton has 8887 states and 9143 transitions. Word has length 1299 [2025-03-03 10:55:46,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:46,425 INFO L471 AbstractCegarLoop]: Abstraction has 8887 states and 9143 transitions. [2025-03-03 10:55:46,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:46,425 INFO L276 IsEmpty]: Start isEmpty. Operand 8887 states and 9143 transitions. [2025-03-03 10:55:46,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1314 [2025-03-03 10:55:46,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:46,438 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-03-03 10:55:46,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:55:46,438 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:46,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:46,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1066514618, now seen corresponding path program 1 times [2025-03-03 10:55:46,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:46,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207709594] [2025-03-03 10:55:46,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:46,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:46,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1313 statements into 1 equivalence classes. [2025-03-03 10:55:46,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1313 of 1313 statements. [2025-03-03 10:55:46,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:46,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 2056 proven. 0 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2025-03-03 10:55:47,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:47,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207709594] [2025-03-03 10:55:47,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207709594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:47,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:47,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:55:47,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017193735] [2025-03-03 10:55:47,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:47,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:55:47,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:47,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:55:47,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:55:47,787 INFO L87 Difference]: Start difference. First operand 8887 states and 9143 transitions. Second operand has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:48,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:48,565 INFO L93 Difference]: Finished difference Result 17450 states and 17960 transitions. [2025-03-03 10:55:48,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:55:48,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 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 1313 [2025-03-03 10:55:48,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:48,575 INFO L225 Difference]: With dead ends: 17450 [2025-03-03 10:55:48,575 INFO L226 Difference]: Without dead ends: 8894 [2025-03-03 10:55:48,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:55:48,581 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:48,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 441 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:55:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8894 states. [2025-03-03 10:55:48,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8894 to 8887. [2025-03-03 10:55:48,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8887 states, 8886 states have (on average 1.0286968264686023) internal successors, (9141), 8886 states have internal predecessors, (9141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:48,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9141 transitions. [2025-03-03 10:55:48,643 INFO L78 Accepts]: Start accepts. Automaton has 8887 states and 9141 transitions. Word has length 1313 [2025-03-03 10:55:48,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:48,643 INFO L471 AbstractCegarLoop]: Abstraction has 8887 states and 9141 transitions. [2025-03-03 10:55:48,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:48,644 INFO L276 IsEmpty]: Start isEmpty. Operand 8887 states and 9141 transitions. [2025-03-03 10:55:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1463 [2025-03-03 10:55:48,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:48,658 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:48,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:55:48,659 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:48,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1217505116, now seen corresponding path program 1 times [2025-03-03 10:55:48,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:48,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259186537] [2025-03-03 10:55:48,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:48,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:48,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1462 statements into 1 equivalence classes. [2025-03-03 10:55:48,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1462 of 1462 statements. [2025-03-03 10:55:48,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:48,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4113 backedges. 1587 proven. 1202 refuted. 0 times theorem prover too weak. 1324 trivial. 0 not checked. [2025-03-03 10:55:49,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:49,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259186537] [2025-03-03 10:55:49,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259186537] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:55:49,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755540566] [2025-03-03 10:55:49,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:49,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:55:49,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:55:49,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:55:49,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:55:50,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1462 statements into 1 equivalence classes. [2025-03-03 10:55:50,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1462 of 1462 statements. [2025-03-03 10:55:50,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:50,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:50,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 1694 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:55:50,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:55:51,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4113 backedges. 2372 proven. 0 refuted. 0 times theorem prover too weak. 1741 trivial. 0 not checked. [2025-03-03 10:55:51,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:55:51,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755540566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:51,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:55:51,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 10:55:51,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877098406] [2025-03-03 10:55:51,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:51,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:51,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:51,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:51,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:55:51,024 INFO L87 Difference]: Start difference. First operand 8887 states and 9141 transitions. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:51,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:51,594 INFO L93 Difference]: Finished difference Result 17443 states and 17949 transitions. [2025-03-03 10:55:51,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:51,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 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 1462 [2025-03-03 10:55:51,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:51,603 INFO L225 Difference]: With dead ends: 17443 [2025-03-03 10:55:51,603 INFO L226 Difference]: Without dead ends: 8887 [2025-03-03 10:55:51,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1466 GetRequests, 1462 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:55:51,608 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 113 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:51,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 377 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:55:51,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8887 states. [2025-03-03 10:55:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8887. [2025-03-03 10:55:51,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8887 states, 8886 states have (on average 1.0247580463650687) internal successors, (9106), 8886 states have internal predecessors, (9106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:51,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9106 transitions. [2025-03-03 10:55:51,699 INFO L78 Accepts]: Start accepts. Automaton has 8887 states and 9106 transitions. Word has length 1462 [2025-03-03 10:55:51,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:51,699 INFO L471 AbstractCegarLoop]: Abstraction has 8887 states and 9106 transitions. [2025-03-03 10:55:51,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:51,700 INFO L276 IsEmpty]: Start isEmpty. Operand 8887 states and 9106 transitions. [2025-03-03 10:55:51,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1793 [2025-03-03 10:55:51,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:51,720 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:51,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 10:55:51,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 10:55:51,920 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:51,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:51,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1887997872, now seen corresponding path program 1 times [2025-03-03 10:55:51,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:51,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614671743] [2025-03-03 10:55:51,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:51,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:52,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1792 statements into 1 equivalence classes. [2025-03-03 10:55:52,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1792 of 1792 statements. [2025-03-03 10:55:52,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:52,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 6580 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 6121 trivial. 0 not checked. [2025-03-03 10:55:53,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:53,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614671743] [2025-03-03 10:55:53,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614671743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:53,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:53,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:53,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84577716] [2025-03-03 10:55:53,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:53,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:53,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:53,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:53,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:53,057 INFO L87 Difference]: Start difference. First operand 8887 states and 9106 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:53,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:53,712 INFO L93 Difference]: Finished difference Result 23363 states and 23966 transitions. [2025-03-03 10:55:53,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:53,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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 1792 [2025-03-03 10:55:53,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:53,714 INFO L225 Difference]: With dead ends: 23363 [2025-03-03 10:55:53,714 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:55:53,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:53,722 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 286 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:53,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 418 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:55:53,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:55:53,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:55:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:55:53,723 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1792 [2025-03-03 10:55:53,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:53,723 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:55:53,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:53,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:55:53,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:55:53,725 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:55:53,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:55:53,728 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:53,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:55:54,215 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:55:54,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:55:54 BoogieIcfgContainer [2025-03-03 10:55:54,238 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:55:54,239 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:55:54,239 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:55:54,240 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:55:54,240 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:55:25" (3/4) ... [2025-03-03 10:55:54,242 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:55:54,271 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-03 10:55:54,273 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:55:54,274 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:55:54,276 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:55:54,415 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:55:54,416 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:55:54,416 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:55:54,417 INFO L158 Benchmark]: Toolchain (without parser) took 31492.32ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 129.2MB in the beginning and 842.8MB in the end (delta: -713.6MB). Peak memory consumption was 624.1MB. Max. memory is 16.1GB. [2025-03-03 10:55:54,417 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:55:54,417 INFO L158 Benchmark]: CACSL2BoogieTranslator took 656.16ms. Allocated memory is still 167.8MB. Free memory was 129.2MB in the beginning and 70.7MB in the end (delta: 58.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-03 10:55:54,417 INFO L158 Benchmark]: Boogie Procedure Inliner took 124.16ms. Allocated memory is still 167.8MB. Free memory was 70.7MB in the beginning and 47.6MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 10:55:54,417 INFO L158 Benchmark]: Boogie Preprocessor took 156.37ms. Allocated memory is still 167.8MB. Free memory was 47.6MB in the beginning and 89.7MB in the end (delta: -42.0MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2025-03-03 10:55:54,418 INFO L158 Benchmark]: IcfgBuilder took 1782.56ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 89.7MB in the beginning and 151.4MB in the end (delta: -61.7MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2025-03-03 10:55:54,418 INFO L158 Benchmark]: TraceAbstraction took 28590.88ms. Allocated memory was 209.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 150.6MB in the beginning and 867.7MB in the end (delta: -717.1MB). Peak memory consumption was 578.7MB. Max. memory is 16.1GB. [2025-03-03 10:55:54,418 INFO L158 Benchmark]: Witness Printer took 177.14ms. Allocated memory is still 1.5GB. Free memory was 867.7MB in the beginning and 842.8MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 10:55:54,419 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.29ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 656.16ms. Allocated memory is still 167.8MB. Free memory was 129.2MB in the beginning and 70.7MB in the end (delta: 58.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 124.16ms. Allocated memory is still 167.8MB. Free memory was 70.7MB in the beginning and 47.6MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 156.37ms. Allocated memory is still 167.8MB. Free memory was 47.6MB in the beginning and 89.7MB in the end (delta: -42.0MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * IcfgBuilder took 1782.56ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 89.7MB in the beginning and 151.4MB in the end (delta: -61.7MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. * TraceAbstraction took 28590.88ms. Allocated memory was 209.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 150.6MB in the beginning and 867.7MB in the end (delta: -717.1MB). Peak memory consumption was 578.7MB. Max. memory is 16.1GB. * Witness Printer took 177.14ms. Allocated memory is still 1.5GB. Free memory was 867.7MB in the beginning and 842.8MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 161]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.0s, OverallIterations: 17, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5057 SdHoareTripleChecker+Valid, 12.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5057 mSDsluCounter, 5193 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 247 mSDsCounter, 2471 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15355 IncrementalHoareTripleChecker+Invalid, 17826 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2471 mSolverCounterUnsat, 4946 mSDtfsCounter, 15355 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2026 GetRequests, 1993 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8887occurred in iteration=12, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 2311 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 15280 NumberOfCodeBlocks, 15280 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 15261 ConstructedInterpolants, 0 QuantifiedInterpolants, 33488 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2292 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 PerfectInterpolantSequences, 32452/33696 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1783]: Location Invariant Derived location invariant: ((((((((((((((a16 == 10) && (a12 == 8)) && (a15 == 3)) || ((((a15 <= 3) && (a12 == 8)) && (((long long) a18 + 156) <= 0)) && (a16 <= 11))) || ((((a16 != 10) && (a12 == 8)) && (a16 <= 11)) && (4 <= a15))) || ((a12 == 6) && (a16 <= 11))) || (((a12 == 9) && (a16 != 10)) && (a16 <= 11))) || ((a15 <= 3) && (a12 <= 7))) || ((a12 == 9) && (a15 <= 3))) || ((a16 <= 8) && (a15 <= 3))) || ((a12 <= 5) && (a16 <= 11))) || (((a16 != 10) && (a12 <= 7)) && (a16 <= 11))) || ((((a15 <= 3) && (a12 == 8)) && (27 <= a18)) && (a16 <= 11))) || (((a15 <= 3) && (a12 == 8)) && (11 <= a16))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:55:54,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE