./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label26.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label26.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 0887ed233b7d9ebaebc7d3592c7422f9d4fe2418c2eecfd5d225ad45a2570d74 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:00:25,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:00:25,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:00:25,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:00:25,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:00:25,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:00:25,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:00:25,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:00:25,691 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:00:25,691 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:00:25,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:00:25,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:00:25,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:00:25,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:00:25,692 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:00:25,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:00:25,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:00:25,692 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:00:25,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:00:25,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:00:25,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:00:25,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:00:25,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:00:25,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:00:25,693 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:00:25,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:00:25,693 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:00:25,693 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:00:25,693 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:00:25,693 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:00:25,693 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:00:25,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:00:25,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:00:25,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:00:25,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:00:25,693 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:00:25,693 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:00:25,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:00:25,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:00:25,693 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:00:25,693 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:00:25,693 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:00:25,693 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:00:25,693 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 -> 0887ed233b7d9ebaebc7d3592c7422f9d4fe2418c2eecfd5d225ad45a2570d74 [2025-03-08 01:00:25,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:00:25,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:00:25,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:00:25,936 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:00:25,936 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:00:25,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label26.c [2025-03-08 01:00:27,113 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1410f1e06/215c58a25d004ae48ebb9a0e70b433d6/FLAG9a441ba89 [2025-03-08 01:00:27,496 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:00:27,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label26.c [2025-03-08 01:00:27,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1410f1e06/215c58a25d004ae48ebb9a0e70b433d6/FLAG9a441ba89 [2025-03-08 01:00:27,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1410f1e06/215c58a25d004ae48ebb9a0e70b433d6 [2025-03-08 01:00:27,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:00:27,537 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:00:27,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:00:27,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:00:27,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:00:27,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:00:27" (1/1) ... [2025-03-08 01:00:27,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21da842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:00:27, skipping insertion in model container [2025-03-08 01:00:27,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:00:27" (1/1) ... [2025-03-08 01:00:27,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:00:27,929 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/Problem03_label26.c[55276,55289] [2025-03-08 01:00:27,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:00:27,984 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:00:28,136 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/Problem03_label26.c[55276,55289] [2025-03-08 01:00:28,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:00:28,166 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:00:28,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:00:28 WrapperNode [2025-03-08 01:00:28,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:00:28,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:00:28,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:00:28,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:00:28,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:00:28" (1/1) ... [2025-03-08 01:00:28,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:00:28" (1/1) ... [2025-03-08 01:00:28,282 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-08 01:00:28,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:00:28,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:00:28,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:00:28,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:00:28,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:00:28" (1/1) ... [2025-03-08 01:00:28,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:00:28" (1/1) ... [2025-03-08 01:00:28,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:00:28" (1/1) ... [2025-03-08 01:00:28,334 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 01:00:28,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:00:28" (1/1) ... [2025-03-08 01:00:28,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:00:28" (1/1) ... [2025-03-08 01:00:28,369 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:00:28" (1/1) ... [2025-03-08 01:00:28,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:00:28" (1/1) ... [2025-03-08 01:00:28,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:00:28" (1/1) ... [2025-03-08 01:00:28,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:00:28" (1/1) ... [2025-03-08 01:00:28,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:00:28,393 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:00:28,393 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:00:28,393 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:00:28,394 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:00:28" (1/1) ... [2025-03-08 01:00:28,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:00:28,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:00:28,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 01:00:28,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 01:00:28,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:00:28,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:00:28,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:00:28,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:00:28,520 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:00:28,521 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:00:29,982 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-08 01:00:29,983 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:00:30,006 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:00:30,006 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:00:30,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:00:30 BoogieIcfgContainer [2025-03-08 01:00:30,007 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:00:30,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:00:30,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:00:30,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:00:30,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:00:27" (1/3) ... [2025-03-08 01:00:30,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb4c8d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:00:30, skipping insertion in model container [2025-03-08 01:00:30,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:00:28" (2/3) ... [2025-03-08 01:00:30,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb4c8d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:00:30, skipping insertion in model container [2025-03-08 01:00:30,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:00:30" (3/3) ... [2025-03-08 01:00:30,018 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label26.c [2025-03-08 01:00:30,032 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:00:30,036 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label26.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:00:30,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:00:30,107 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;@22b05447, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:00:30,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:00:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:30,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 01:00:30,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:00:30,120 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:00:30,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:00:30,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:00:30,125 INFO L85 PathProgramCache]: Analyzing trace with hash 504270208, now seen corresponding path program 1 times [2025-03-08 01:00:30,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:00:30,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264751414] [2025-03-08 01:00:30,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:30,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:00:30,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 01:00:30,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 01:00:30,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:30,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:30,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:00:30,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:00:30,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264751414] [2025-03-08 01:00:30,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264751414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:00:30,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:00:30,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:00:30,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524547130] [2025-03-08 01:00:30,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:00:30,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:00:30,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:00:30,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:00:30,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:00:30,887 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 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 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:31,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:00:31,746 INFO L93 Difference]: Finished difference Result 810 states and 1442 transitions. [2025-03-08 01:00:31,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:00:31,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-03-08 01:00:31,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:00:31,755 INFO L225 Difference]: With dead ends: 810 [2025-03-08 01:00:31,755 INFO L226 Difference]: Without dead ends: 444 [2025-03-08 01:00:31,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:00:31,761 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 98 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:00:31,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 231 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:00:31,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-08 01:00:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2025-03-08 01:00:31,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 1.4288939051918736) internal successors, (633), 443 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 633 transitions. [2025-03-08 01:00:31,800 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 633 transitions. Word has length 156 [2025-03-08 01:00:31,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:00:31,800 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 633 transitions. [2025-03-08 01:00:31,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:31,800 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 633 transitions. [2025-03-08 01:00:31,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 01:00:31,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:00:31,802 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 01:00:31,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:00:31,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:00:31,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:00:31,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1518607402, now seen corresponding path program 1 times [2025-03-08 01:00:31,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:00:31,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458748977] [2025-03-08 01:00:31,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:31,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:00:31,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 01:00:31,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 01:00:31,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:31,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:00:32,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:00:32,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458748977] [2025-03-08 01:00:32,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458748977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:00:32,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:00:32,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:00:32,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009227870] [2025-03-08 01:00:32,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:00:32,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:00:32,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:00:32,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:00:32,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:00:32,004 INFO L87 Difference]: Start difference. First operand 444 states and 633 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:32,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:00:32,689 INFO L93 Difference]: Finished difference Result 1312 states and 1878 transitions. [2025-03-08 01:00:32,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:00:32,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-03-08 01:00:32,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:00:32,695 INFO L225 Difference]: With dead ends: 1312 [2025-03-08 01:00:32,695 INFO L226 Difference]: Without dead ends: 870 [2025-03-08 01:00:32,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:00:32,697 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:00:32,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 93 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 01:00:32,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-03-08 01:00:32,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 856. [2025-03-08 01:00:32,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 855 states have (on average 1.3941520467836257) internal successors, (1192), 855 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:32,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1192 transitions. [2025-03-08 01:00:32,723 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1192 transitions. Word has length 164 [2025-03-08 01:00:32,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:00:32,723 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1192 transitions. [2025-03-08 01:00:32,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:32,723 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1192 transitions. [2025-03-08 01:00:32,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 01:00:32,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:00:32,729 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:00:32,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:00:32,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:00:32,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:00:32,730 INFO L85 PathProgramCache]: Analyzing trace with hash 649037231, now seen corresponding path program 1 times [2025-03-08 01:00:32,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:00:32,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520980693] [2025-03-08 01:00:32,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:32,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:00:32,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 01:00:32,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 01:00:32,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:32,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 01:00:33,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:00:33,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520980693] [2025-03-08 01:00:33,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520980693] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:00:33,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404645383] [2025-03-08 01:00:33,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:33,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:00:33,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:00:33,071 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-08 01:00:33,074 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-08 01:00:33,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 01:00:33,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 01:00:33,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:33,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:33,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:00:33,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:00:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 01:00:33,267 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:00:33,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404645383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:00:33,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:00:33,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-08 01:00:33,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955859146] [2025-03-08 01:00:33,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:00:33,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:00:33,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:00:33,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:00:33,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:00:33,271 INFO L87 Difference]: Start difference. First operand 856 states and 1192 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:33,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:00:33,490 INFO L93 Difference]: Finished difference Result 2562 states and 3570 transitions. [2025-03-08 01:00:33,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:00:33,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 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 176 [2025-03-08 01:00:33,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:00:33,496 INFO L225 Difference]: With dead ends: 2562 [2025-03-08 01:00:33,496 INFO L226 Difference]: Without dead ends: 1708 [2025-03-08 01:00:33,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:00:33,498 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 360 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 01:00:33,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 601 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 01:00:33,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2025-03-08 01:00:33,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1705. [2025-03-08 01:00:33,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1704 states have (on average 1.3937793427230047) internal successors, (2375), 1704 states have internal predecessors, (2375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2375 transitions. [2025-03-08 01:00:33,566 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2375 transitions. Word has length 176 [2025-03-08 01:00:33,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:00:33,566 INFO L471 AbstractCegarLoop]: Abstraction has 1705 states and 2375 transitions. [2025-03-08 01:00:33,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:33,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2375 transitions. [2025-03-08 01:00:33,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-08 01:00:33,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:00:33,574 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:00:33,584 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-08 01:00:33,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:00:33,775 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:00:33,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:00:33,775 INFO L85 PathProgramCache]: Analyzing trace with hash -265681381, now seen corresponding path program 1 times [2025-03-08 01:00:33,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:00:33,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625492936] [2025-03-08 01:00:33,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:33,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:00:33,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-08 01:00:33,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-08 01:00:33,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:33,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:33,944 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 01:00:33,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:00:33,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625492936] [2025-03-08 01:00:33,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625492936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:00:33,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:00:33,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:00:33,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896611026] [2025-03-08 01:00:33,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:00:33,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:00:33,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:00:33,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:00:33,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:00:33,948 INFO L87 Difference]: Start difference. First operand 1705 states and 2375 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:34,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:00:34,292 INFO L93 Difference]: Finished difference Result 3368 states and 4692 transitions. [2025-03-08 01:00:34,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:00:34,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2025-03-08 01:00:34,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:00:34,297 INFO L225 Difference]: With dead ends: 3368 [2025-03-08 01:00:34,297 INFO L226 Difference]: Without dead ends: 1665 [2025-03-08 01:00:34,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:00:34,300 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 326 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:00:34,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:00:34,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2025-03-08 01:00:34,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665. [2025-03-08 01:00:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1664 states have (on average 1.3527644230769231) internal successors, (2251), 1664 states have internal predecessors, (2251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:34,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2251 transitions. [2025-03-08 01:00:34,329 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2251 transitions. Word has length 184 [2025-03-08 01:00:34,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:00:34,329 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2251 transitions. [2025-03-08 01:00:34,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2251 transitions. [2025-03-08 01:00:34,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 01:00:34,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:00:34,332 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:00:34,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:00:34,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:00:34,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:00:34,333 INFO L85 PathProgramCache]: Analyzing trace with hash -259827294, now seen corresponding path program 1 times [2025-03-08 01:00:34,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:00:34,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598479607] [2025-03-08 01:00:34,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:34,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:00:34,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 01:00:34,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 01:00:34,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:34,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:34,448 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 01:00:34,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:00:34,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598479607] [2025-03-08 01:00:34,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598479607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:00:34,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:00:34,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:00:34,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600208739] [2025-03-08 01:00:34,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:00:34,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:00:34,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:00:34,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:00:34,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:00:34,450 INFO L87 Difference]: Start difference. First operand 1665 states and 2251 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:35,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:00:35,101 INFO L93 Difference]: Finished difference Result 4961 states and 6709 transitions. [2025-03-08 01:00:35,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:00:35,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 185 [2025-03-08 01:00:35,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:00:35,111 INFO L225 Difference]: With dead ends: 4961 [2025-03-08 01:00:35,112 INFO L226 Difference]: Without dead ends: 3298 [2025-03-08 01:00:35,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:00:35,115 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 243 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:00:35,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 330 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:00:35,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2025-03-08 01:00:35,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 3295. [2025-03-08 01:00:35,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3295 states, 3294 states have (on average 1.2674559805707346) internal successors, (4175), 3294 states have internal predecessors, (4175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:35,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3295 states to 3295 states and 4175 transitions. [2025-03-08 01:00:35,173 INFO L78 Accepts]: Start accepts. Automaton has 3295 states and 4175 transitions. Word has length 185 [2025-03-08 01:00:35,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:00:35,173 INFO L471 AbstractCegarLoop]: Abstraction has 3295 states and 4175 transitions. [2025-03-08 01:00:35,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:35,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3295 states and 4175 transitions. [2025-03-08 01:00:35,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-08 01:00:35,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:00:35,179 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:00:35,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 01:00:35,179 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:00:35,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:00:35,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1459112609, now seen corresponding path program 1 times [2025-03-08 01:00:35,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:00:35,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188595300] [2025-03-08 01:00:35,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:35,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:00:35,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 01:00:35,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 01:00:35,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:35,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 01:00:35,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:00:35,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188595300] [2025-03-08 01:00:35,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188595300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:00:35,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:00:35,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:00:35,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046797962] [2025-03-08 01:00:35,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:00:35,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:00:35,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:00:35,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:00:35,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:00:35,406 INFO L87 Difference]: Start difference. First operand 3295 states and 4175 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:36,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:00:36,045 INFO L93 Difference]: Finished difference Result 8217 states and 10683 transitions. [2025-03-08 01:00:36,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:00:36,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 197 [2025-03-08 01:00:36,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:00:36,060 INFO L225 Difference]: With dead ends: 8217 [2025-03-08 01:00:36,060 INFO L226 Difference]: Without dead ends: 4924 [2025-03-08 01:00:36,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:00:36,066 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 193 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:00:36,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 370 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:00:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4924 states. [2025-03-08 01:00:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4924 to 4919. [2025-03-08 01:00:36,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4919 states, 4918 states have (on average 1.2157381049206994) internal successors, (5979), 4918 states have internal predecessors, (5979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4919 states to 4919 states and 5979 transitions. [2025-03-08 01:00:36,152 INFO L78 Accepts]: Start accepts. Automaton has 4919 states and 5979 transitions. Word has length 197 [2025-03-08 01:00:36,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:00:36,153 INFO L471 AbstractCegarLoop]: Abstraction has 4919 states and 5979 transitions. [2025-03-08 01:00:36,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:36,153 INFO L276 IsEmpty]: Start isEmpty. Operand 4919 states and 5979 transitions. [2025-03-08 01:00:36,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-08 01:00:36,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:00:36,159 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-08 01:00:36,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 01:00:36,160 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:00:36,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:00:36,160 INFO L85 PathProgramCache]: Analyzing trace with hash -364300258, now seen corresponding path program 1 times [2025-03-08 01:00:36,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:00:36,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519559927] [2025-03-08 01:00:36,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:36,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:00:36,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 01:00:36,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 01:00:36,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:36,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:37,180 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 73 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 01:00:37,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:00:37,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519559927] [2025-03-08 01:00:37,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519559927] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:00:37,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062745664] [2025-03-08 01:00:37,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:37,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:00:37,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:00:37,183 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-08 01:00:37,185 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-08 01:00:37,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 01:00:37,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 01:00:37,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:37,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:37,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 01:00:37,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:00:37,366 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 01:00:37,368 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:00:37,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062745664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:00:37,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:00:37,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 01:00:37,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325204219] [2025-03-08 01:00:37,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:00:37,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:00:37,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:00:37,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:00:37,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:00:37,370 INFO L87 Difference]: Start difference. First operand 4919 states and 5979 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:38,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:00:38,093 INFO L93 Difference]: Finished difference Result 14713 states and 17883 transitions. [2025-03-08 01:00:38,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:00:38,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 224 [2025-03-08 01:00:38,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:00:38,122 INFO L225 Difference]: With dead ends: 14713 [2025-03-08 01:00:38,123 INFO L226 Difference]: Without dead ends: 9796 [2025-03-08 01:00:38,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:00:38,131 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 218 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:00:38,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 317 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:00:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9796 states. [2025-03-08 01:00:38,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9796 to 9791. [2025-03-08 01:00:38,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9791 states, 9790 states have (on average 1.1753830439223698) internal successors, (11507), 9790 states have internal predecessors, (11507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:38,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9791 states to 9791 states and 11507 transitions. [2025-03-08 01:00:38,345 INFO L78 Accepts]: Start accepts. Automaton has 9791 states and 11507 transitions. Word has length 224 [2025-03-08 01:00:38,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:00:38,345 INFO L471 AbstractCegarLoop]: Abstraction has 9791 states and 11507 transitions. [2025-03-08 01:00:38,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:38,346 INFO L276 IsEmpty]: Start isEmpty. Operand 9791 states and 11507 transitions. [2025-03-08 01:00:38,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-08 01:00:38,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:00:38,357 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:00:38,364 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-08 01:00:38,557 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,SelfDestructingSolverStorable6 [2025-03-08 01:00:38,558 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:00:38,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:00:38,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1806606727, now seen corresponding path program 1 times [2025-03-08 01:00:38,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:00:38,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313370659] [2025-03-08 01:00:38,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:38,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:00:38,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-08 01:00:38,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-08 01:00:38,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:38,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:38,741 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:00:38,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:00:38,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313370659] [2025-03-08 01:00:38,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313370659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:00:38,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:00:38,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:00:38,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272732109] [2025-03-08 01:00:38,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:00:38,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:00:38,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:00:38,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:00:38,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:00:38,744 INFO L87 Difference]: Start difference. First operand 9791 states and 11507 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 2 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:39,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:00:39,437 INFO L93 Difference]: Finished difference Result 19585 states and 23021 transitions. [2025-03-08 01:00:39,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:00:39,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 2 states have internal predecessors, (234), 0 states have call successors, (0), 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 234 [2025-03-08 01:00:39,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:00:39,466 INFO L225 Difference]: With dead ends: 19585 [2025-03-08 01:00:39,466 INFO L226 Difference]: Without dead ends: 9796 [2025-03-08 01:00:39,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:00:39,476 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 165 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:00:39,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 121 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:00:39,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9796 states. [2025-03-08 01:00:39,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9796 to 9791. [2025-03-08 01:00:39,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9791 states, 9790 states have (on average 1.146782431052094) internal successors, (11227), 9790 states have internal predecessors, (11227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:39,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9791 states to 9791 states and 11227 transitions. [2025-03-08 01:00:39,634 INFO L78 Accepts]: Start accepts. Automaton has 9791 states and 11227 transitions. Word has length 234 [2025-03-08 01:00:39,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:00:39,634 INFO L471 AbstractCegarLoop]: Abstraction has 9791 states and 11227 transitions. [2025-03-08 01:00:39,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 2 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:39,635 INFO L276 IsEmpty]: Start isEmpty. Operand 9791 states and 11227 transitions. [2025-03-08 01:00:39,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-08 01:00:39,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:00:39,646 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 01:00:39,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 01:00:39,646 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:00:39,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:00:39,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2114709292, now seen corresponding path program 1 times [2025-03-08 01:00:39,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:00:39,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32133987] [2025-03-08 01:00:39,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:39,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:00:39,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-08 01:00:39,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-08 01:00:39,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:39,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:39,974 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 01:00:39,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:00:39,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32133987] [2025-03-08 01:00:39,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32133987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:00:39,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:00:39,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:00:39,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158703336] [2025-03-08 01:00:39,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:00:39,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:00:39,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:00:39,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:00:39,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:00:39,977 INFO L87 Difference]: Start difference. First operand 9791 states and 11227 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:40,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:00:40,768 INFO L93 Difference]: Finished difference Result 24261 states and 27784 transitions. [2025-03-08 01:00:40,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:00:40,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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 249 [2025-03-08 01:00:40,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:00:40,799 INFO L225 Difference]: With dead ends: 24261 [2025-03-08 01:00:40,800 INFO L226 Difference]: Without dead ends: 14472 [2025-03-08 01:00:40,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:00:40,817 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 136 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:00:40,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 367 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 01:00:40,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14472 states. [2025-03-08 01:00:41,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14472 to 14465. [2025-03-08 01:00:41,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14465 states, 14464 states have (on average 1.1285951327433628) internal successors, (16324), 14464 states have internal predecessors, (16324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14465 states to 14465 states and 16324 transitions. [2025-03-08 01:00:41,076 INFO L78 Accepts]: Start accepts. Automaton has 14465 states and 16324 transitions. Word has length 249 [2025-03-08 01:00:41,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:00:41,076 INFO L471 AbstractCegarLoop]: Abstraction has 14465 states and 16324 transitions. [2025-03-08 01:00:41,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 14465 states and 16324 transitions. [2025-03-08 01:00:41,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-08 01:00:41,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:00:41,091 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:00:41,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 01:00:41,091 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:00:41,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:00:41,092 INFO L85 PathProgramCache]: Analyzing trace with hash -395829606, now seen corresponding path program 1 times [2025-03-08 01:00:41,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:00:41,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269086269] [2025-03-08 01:00:41,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:41,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:00:41,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-08 01:00:41,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-08 01:00:41,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:41,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-08 01:00:41,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:00:41,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269086269] [2025-03-08 01:00:41,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269086269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:00:41,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:00:41,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:00:41,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679529176] [2025-03-08 01:00:41,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:00:41,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:00:41,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:00:41,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:00:41,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:00:41,299 INFO L87 Difference]: Start difference. First operand 14465 states and 16324 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:41,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:00:41,987 INFO L93 Difference]: Finished difference Result 37689 states and 42483 transitions. [2025-03-08 01:00:41,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:00:41,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 262 [2025-03-08 01:00:41,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:00:42,024 INFO L225 Difference]: With dead ends: 37689 [2025-03-08 01:00:42,025 INFO L226 Difference]: Without dead ends: 23226 [2025-03-08 01:00:42,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:00:42,041 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 205 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:00:42,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 68 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:00:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23226 states. [2025-03-08 01:00:42,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23226 to 23223. [2025-03-08 01:00:42,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23223 states, 23222 states have (on average 1.1250107656532597) internal successors, (26125), 23222 states have internal predecessors, (26125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:42,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23223 states to 23223 states and 26125 transitions. [2025-03-08 01:00:42,350 INFO L78 Accepts]: Start accepts. Automaton has 23223 states and 26125 transitions. Word has length 262 [2025-03-08 01:00:42,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:00:42,350 INFO L471 AbstractCegarLoop]: Abstraction has 23223 states and 26125 transitions. [2025-03-08 01:00:42,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:42,350 INFO L276 IsEmpty]: Start isEmpty. Operand 23223 states and 26125 transitions. [2025-03-08 01:00:42,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-08 01:00:42,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:00:42,375 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:00:42,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 01:00:42,375 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:00:42,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:00:42,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1604912651, now seen corresponding path program 1 times [2025-03-08 01:00:42,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:00:42,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115645126] [2025-03-08 01:00:42,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:42,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:00:42,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-08 01:00:42,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-08 01:00:42,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:42,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-08 01:00:42,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:00:42,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115645126] [2025-03-08 01:00:42,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115645126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:00:42,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:00:42,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:00:42,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478432006] [2025-03-08 01:00:42,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:00:42,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:00:42,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:00:42,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:00:42,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:00:42,588 INFO L87 Difference]: Start difference. First operand 23223 states and 26125 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:43,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:00:43,234 INFO L93 Difference]: Finished difference Result 46448 states and 52256 transitions. [2025-03-08 01:00:43,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:00:43,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 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 264 [2025-03-08 01:00:43,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:00:43,267 INFO L225 Difference]: With dead ends: 46448 [2025-03-08 01:00:43,267 INFO L226 Difference]: Without dead ends: 23227 [2025-03-08 01:00:43,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:00:43,288 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 222 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:00:43,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 103 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:00:43,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23227 states. [2025-03-08 01:00:43,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23227 to 23223. [2025-03-08 01:00:43,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23223 states, 23222 states have (on average 1.1095943501851693) internal successors, (25767), 23222 states have internal predecessors, (25767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:43,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23223 states to 23223 states and 25767 transitions. [2025-03-08 01:00:43,660 INFO L78 Accepts]: Start accepts. Automaton has 23223 states and 25767 transitions. Word has length 264 [2025-03-08 01:00:43,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:00:43,660 INFO L471 AbstractCegarLoop]: Abstraction has 23223 states and 25767 transitions. [2025-03-08 01:00:43,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:43,661 INFO L276 IsEmpty]: Start isEmpty. Operand 23223 states and 25767 transitions. [2025-03-08 01:00:43,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-08 01:00:43,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:00:43,680 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:00:43,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 01:00:43,680 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:00:43,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:00:43,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1072062656, now seen corresponding path program 1 times [2025-03-08 01:00:43,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:00:43,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026638615] [2025-03-08 01:00:43,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:43,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:00:43,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-08 01:00:43,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-08 01:00:43,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:43,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:43,898 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:00:43,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:00:43,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026638615] [2025-03-08 01:00:43,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026638615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:00:43,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:00:43,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:00:43,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727236156] [2025-03-08 01:00:43,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:00:43,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:00:43,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:00:43,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:00:43,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:00:43,901 INFO L87 Difference]: Start difference. First operand 23223 states and 25767 transitions. Second operand has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:44,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:00:44,945 INFO L93 Difference]: Finished difference Result 48903 states and 54432 transitions. [2025-03-08 01:00:44,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:00:44,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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 265 [2025-03-08 01:00:44,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:00:44,976 INFO L225 Difference]: With dead ends: 48903 [2025-03-08 01:00:44,977 INFO L226 Difference]: Without dead ends: 25682 [2025-03-08 01:00:44,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:00:44,994 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 327 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:00:44,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 90 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 01:00:45,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25682 states. [2025-03-08 01:00:45,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25682 to 23223. [2025-03-08 01:00:45,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23223 states, 23222 states have (on average 1.1095943501851693) internal successors, (25767), 23222 states have internal predecessors, (25767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23223 states to 23223 states and 25767 transitions. [2025-03-08 01:00:45,333 INFO L78 Accepts]: Start accepts. Automaton has 23223 states and 25767 transitions. Word has length 265 [2025-03-08 01:00:45,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:00:45,334 INFO L471 AbstractCegarLoop]: Abstraction has 23223 states and 25767 transitions. [2025-03-08 01:00:45,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:45,334 INFO L276 IsEmpty]: Start isEmpty. Operand 23223 states and 25767 transitions. [2025-03-08 01:00:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-08 01:00:45,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:00:45,355 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 01:00:45,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 01:00:45,355 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:00:45,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:00:45,355 INFO L85 PathProgramCache]: Analyzing trace with hash -397243233, now seen corresponding path program 1 times [2025-03-08 01:00:45,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:00:45,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353978411] [2025-03-08 01:00:45,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:45,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:00:45,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-08 01:00:45,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-08 01:00:45,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:45,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:45,657 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 68 proven. 6 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-08 01:00:45,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:00:45,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353978411] [2025-03-08 01:00:45,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353978411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:00:45,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749157278] [2025-03-08 01:00:45,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:45,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:00:45,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:00:45,660 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:00:45,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 01:00:45,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-08 01:00:45,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-08 01:00:45,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:45,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:45,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 01:00:45,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:00:45,895 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-08 01:00:45,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:00:45,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749157278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:00:45,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:00:45,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-08 01:00:45,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727757699] [2025-03-08 01:00:45,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:00:45,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:00:45,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:00:45,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:00:45,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:00:45,897 INFO L87 Difference]: Start difference. First operand 23223 states and 25767 transitions. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:46,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:00:46,661 INFO L93 Difference]: Finished difference Result 66583 states and 73947 transitions. [2025-03-08 01:00:46,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:00:46,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 269 [2025-03-08 01:00:46,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:00:46,714 INFO L225 Difference]: With dead ends: 66583 [2025-03-08 01:00:46,714 INFO L226 Difference]: Without dead ends: 43362 [2025-03-08 01:00:46,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:00:46,738 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 525 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:00:46,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 316 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:00:46,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43362 states. [2025-03-08 01:00:47,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43362 to 40916. [2025-03-08 01:00:47,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40916 states, 40915 states have (on average 1.1133080777221067) internal successors, (45551), 40915 states have internal predecessors, (45551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40916 states to 40916 states and 45551 transitions. [2025-03-08 01:00:47,197 INFO L78 Accepts]: Start accepts. Automaton has 40916 states and 45551 transitions. Word has length 269 [2025-03-08 01:00:47,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:00:47,197 INFO L471 AbstractCegarLoop]: Abstraction has 40916 states and 45551 transitions. [2025-03-08 01:00:47,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 40916 states and 45551 transitions. [2025-03-08 01:00:47,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-08 01:00:47,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:00:47,215 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 01:00:47,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 01:00:47,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:00:47,415 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:00:47,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:00:47,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1908373659, now seen corresponding path program 1 times [2025-03-08 01:00:47,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:00:47,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069211313] [2025-03-08 01:00:47,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:47,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:00:47,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 01:00:47,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 01:00:47,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:47,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-08 01:00:48,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:00:48,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069211313] [2025-03-08 01:00:48,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069211313] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:00:48,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299239825] [2025-03-08 01:00:48,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:48,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:00:48,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:00:48,263 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:00:48,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 01:00:48,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 01:00:48,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 01:00:48,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:48,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:48,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 01:00:48,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:00:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-08 01:00:48,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:00:48,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299239825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:00:48,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:00:48,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 01:00:48,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263171477] [2025-03-08 01:00:48,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:00:48,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:00:48,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:00:48,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:00:48,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:00:48,494 INFO L87 Difference]: Start difference. First operand 40916 states and 45551 transitions. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:49,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:00:49,444 INFO L93 Difference]: Finished difference Result 122136 states and 136181 transitions. [2025-03-08 01:00:49,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:00:49,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 272 [2025-03-08 01:00:49,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:00:49,541 INFO L225 Difference]: With dead ends: 122136 [2025-03-08 01:00:49,541 INFO L226 Difference]: Without dead ends: 81222 [2025-03-08 01:00:49,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:00:49,578 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 492 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:00:49,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 482 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 01:00:49,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81222 states. [2025-03-08 01:00:50,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81222 to 81199. [2025-03-08 01:00:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81199 states, 81198 states have (on average 1.1127490824897166) internal successors, (90353), 81198 states have internal predecessors, (90353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81199 states to 81199 states and 90353 transitions. [2025-03-08 01:00:50,711 INFO L78 Accepts]: Start accepts. Automaton has 81199 states and 90353 transitions. Word has length 272 [2025-03-08 01:00:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:00:50,712 INFO L471 AbstractCegarLoop]: Abstraction has 81199 states and 90353 transitions. [2025-03-08 01:00:50,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 81199 states and 90353 transitions. [2025-03-08 01:00:50,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-03-08 01:00:50,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:00:50,739 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:00:50,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 01:00:50,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:00:50,940 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:00:50,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:00:50,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1438621623, now seen corresponding path program 1 times [2025-03-08 01:00:50,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:00:50,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617873889] [2025-03-08 01:00:50,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:50,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:00:50,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-08 01:00:51,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-08 01:00:51,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:51,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 01:00:51,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:00:51,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617873889] [2025-03-08 01:00:51,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617873889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:00:51,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:00:51,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:00:51,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277513485] [2025-03-08 01:00:51,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:00:51,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:00:51,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:00:51,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:00:51,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:00:51,176 INFO L87 Difference]: Start difference. First operand 81199 states and 90353 transitions. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:52,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:00:52,171 INFO L93 Difference]: Finished difference Result 162004 states and 180268 transitions. [2025-03-08 01:00:52,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:00:52,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 290 [2025-03-08 01:00:52,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:00:52,289 INFO L225 Difference]: With dead ends: 162004 [2025-03-08 01:00:52,289 INFO L226 Difference]: Without dead ends: 80807 [2025-03-08 01:00:52,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:00:52,333 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 792 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:00:52,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 44 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:00:52,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80807 states. [2025-03-08 01:00:53,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80807 to 76721. [2025-03-08 01:00:53,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76721 states, 76720 states have (on average 1.101055787278415) internal successors, (84473), 76720 states have internal predecessors, (84473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76721 states to 76721 states and 84473 transitions. [2025-03-08 01:00:53,398 INFO L78 Accepts]: Start accepts. Automaton has 76721 states and 84473 transitions. Word has length 290 [2025-03-08 01:00:53,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:00:53,398 INFO L471 AbstractCegarLoop]: Abstraction has 76721 states and 84473 transitions. [2025-03-08 01:00:53,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:53,398 INFO L276 IsEmpty]: Start isEmpty. Operand 76721 states and 84473 transitions. [2025-03-08 01:00:53,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-08 01:00:53,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:00:53,416 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-08 01:00:53,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 01:00:53,416 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:00:53,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:00:53,416 INFO L85 PathProgramCache]: Analyzing trace with hash 218122685, now seen corresponding path program 1 times [2025-03-08 01:00:53,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:00:53,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943748730] [2025-03-08 01:00:53,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:53,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:00:53,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-08 01:00:53,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-08 01:00:53,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:53,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-08 01:00:53,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:00:53,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943748730] [2025-03-08 01:00:53,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943748730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:00:53,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:00:53,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:00:53,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160352487] [2025-03-08 01:00:53,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:00:53,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:00:53,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:00:53,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:00:53,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:00:53,585 INFO L87 Difference]: Start difference. First operand 76721 states and 84473 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:54,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:00:54,614 INFO L93 Difference]: Finished difference Result 195565 states and 214636 transitions. [2025-03-08 01:00:54,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:00:54,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 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 304 [2025-03-08 01:00:54,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:00:54,758 INFO L225 Difference]: With dead ends: 195565 [2025-03-08 01:00:54,758 INFO L226 Difference]: Without dead ends: 118846 [2025-03-08 01:00:54,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:00:54,819 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 153 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:00:54,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 159 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 01:00:54,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118846 states. [2025-03-08 01:00:56,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118846 to 109092. [2025-03-08 01:00:56,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109092 states, 109091 states have (on average 1.1009249158959034) internal successors, (120101), 109091 states have internal predecessors, (120101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:56,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109092 states to 109092 states and 120101 transitions. [2025-03-08 01:00:56,418 INFO L78 Accepts]: Start accepts. Automaton has 109092 states and 120101 transitions. Word has length 304 [2025-03-08 01:00:56,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:00:56,418 INFO L471 AbstractCegarLoop]: Abstraction has 109092 states and 120101 transitions. [2025-03-08 01:00:56,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 109092 states and 120101 transitions. [2025-03-08 01:00:56,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-08 01:00:56,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:00:56,447 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:00:56,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 01:00:56,448 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:00:56,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:00:56,448 INFO L85 PathProgramCache]: Analyzing trace with hash -21357124, now seen corresponding path program 1 times [2025-03-08 01:00:56,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:00:56,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047874046] [2025-03-08 01:00:56,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:56,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:00:56,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 01:00:56,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 01:00:56,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:56,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 151 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:00:56,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:00:56,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047874046] [2025-03-08 01:00:56,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047874046] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:00:56,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403008254] [2025-03-08 01:00:56,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:56,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:00:56,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:00:57,001 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:00:57,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 01:00:57,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 01:00:57,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 01:00:57,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:57,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:57,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:00:57,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:00:57,196 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:00:57,197 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:00:57,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403008254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:00:57,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:00:57,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-08 01:00:57,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293614203] [2025-03-08 01:00:57,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:00:57,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:00:57,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:00:57,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:00:57,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:00:57,198 INFO L87 Difference]: Start difference. First operand 109092 states and 120101 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:00:58,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:00:58,101 INFO L93 Difference]: Finished difference Result 308416 states and 340017 transitions. [2025-03-08 01:00:58,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:00:58,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 308 [2025-03-08 01:00:58,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:00:58,383 INFO L225 Difference]: With dead ends: 308416 [2025-03-08 01:00:58,383 INFO L226 Difference]: Without dead ends: 191206 [2025-03-08 01:00:58,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 307 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-08 01:00:58,470 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 218 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 01:00:58,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 824 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 01:00:58,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191206 states. [2025-03-08 01:01:00,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191206 to 180648. [2025-03-08 01:01:00,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180648 states, 180647 states have (on average 1.085260203601499) internal successors, (196049), 180647 states have internal predecessors, (196049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:01,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180648 states to 180648 states and 196049 transitions. [2025-03-08 01:01:01,394 INFO L78 Accepts]: Start accepts. Automaton has 180648 states and 196049 transitions. Word has length 308 [2025-03-08 01:01:01,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:01:01,395 INFO L471 AbstractCegarLoop]: Abstraction has 180648 states and 196049 transitions. [2025-03-08 01:01:01,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:01,399 INFO L276 IsEmpty]: Start isEmpty. Operand 180648 states and 196049 transitions. [2025-03-08 01:01:01,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-08 01:01:01,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:01:01,443 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:01:01,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 01:01:01,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 01:01:01,644 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:01:01,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:01:01,644 INFO L85 PathProgramCache]: Analyzing trace with hash 541614466, now seen corresponding path program 1 times [2025-03-08 01:01:01,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:01:01,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073000097] [2025-03-08 01:01:01,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:01,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:01:01,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 01:01:01,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 01:01:01,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:01,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:02,897 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 166 proven. 6 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-08 01:01:02,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:01:02,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073000097] [2025-03-08 01:01:02,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073000097] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:01:02,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136078071] [2025-03-08 01:01:02,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:02,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:01:02,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:01:02,900 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:01:02,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 01:01:02,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 01:01:03,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 01:01:03,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:03,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:03,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:01:03,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:01:03,176 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-08 01:01:03,177 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:01:03,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136078071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:01:03,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:01:03,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-08 01:01:03,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884899241] [2025-03-08 01:01:03,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:01:03,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:01:03,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:01:03,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:01:03,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:01:03,178 INFO L87 Difference]: Start difference. First operand 180648 states and 196049 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:01:04,537 INFO L93 Difference]: Finished difference Result 440607 states and 478404 transitions. [2025-03-08 01:01:04,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:01:04,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 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 311 [2025-03-08 01:01:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:01:05,247 INFO L225 Difference]: With dead ends: 440607 [2025-03-08 01:01:05,248 INFO L226 Difference]: Without dead ends: 259961 [2025-03-08 01:01:05,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:01:05,332 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 154 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:01:05,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 131 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:01:05,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259961 states. [2025-03-08 01:01:07,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259961 to 180883. [2025-03-08 01:01:07,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180883 states, 180882 states have (on average 1.0975000276423303) internal successors, (198518), 180882 states have internal predecessors, (198518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180883 states to 180883 states and 198518 transitions. [2025-03-08 01:01:08,173 INFO L78 Accepts]: Start accepts. Automaton has 180883 states and 198518 transitions. Word has length 311 [2025-03-08 01:01:08,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:01:08,174 INFO L471 AbstractCegarLoop]: Abstraction has 180883 states and 198518 transitions. [2025-03-08 01:01:08,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:08,174 INFO L276 IsEmpty]: Start isEmpty. Operand 180883 states and 198518 transitions. [2025-03-08 01:01:08,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-08 01:01:08,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:01:08,210 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:01:08,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 01:01:08,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 01:01:08,411 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:01:08,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:01:08,411 INFO L85 PathProgramCache]: Analyzing trace with hash 787066345, now seen corresponding path program 1 times [2025-03-08 01:01:08,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:01:08,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115214311] [2025-03-08 01:01:08,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:08,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:01:08,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-08 01:01:08,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-08 01:01:08,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:08,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:08,730 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 01:01:08,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:01:08,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115214311] [2025-03-08 01:01:08,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115214311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:01:08,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:01:08,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:01:08,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071431470] [2025-03-08 01:01:08,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:01:08,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:01:08,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:01:08,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:01:08,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:01:08,735 INFO L87 Difference]: Start difference. First operand 180883 states and 198518 transitions. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:10,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:01:10,811 INFO L93 Difference]: Finished difference Result 483292 states and 528929 transitions. [2025-03-08 01:01:10,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:01:10,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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 333 [2025-03-08 01:01:10,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:01:11,229 INFO L225 Difference]: With dead ends: 483292 [2025-03-08 01:01:11,230 INFO L226 Difference]: Without dead ends: 302411 [2025-03-08 01:01:11,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:01:11,309 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 444 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:01:11,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 439 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:01:11,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302411 states. [2025-03-08 01:01:14,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302411 to 281279. [2025-03-08 01:01:15,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281279 states, 281278 states have (on average 1.0972774266028626) internal successors, (308640), 281278 states have internal predecessors, (308640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281279 states to 281279 states and 308640 transitions. [2025-03-08 01:01:15,351 INFO L78 Accepts]: Start accepts. Automaton has 281279 states and 308640 transitions. Word has length 333 [2025-03-08 01:01:15,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:01:15,352 INFO L471 AbstractCegarLoop]: Abstraction has 281279 states and 308640 transitions. [2025-03-08 01:01:15,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:15,352 INFO L276 IsEmpty]: Start isEmpty. Operand 281279 states and 308640 transitions. [2025-03-08 01:01:15,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-03-08 01:01:15,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:01:15,387 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:01:15,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 01:01:15,387 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:01:15,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:01:15,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1704326538, now seen corresponding path program 1 times [2025-03-08 01:01:15,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:01:15,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307851755] [2025-03-08 01:01:15,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:15,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:01:15,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-08 01:01:15,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-08 01:01:15,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:15,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:15,919 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 01:01:15,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:01:15,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307851755] [2025-03-08 01:01:15,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307851755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:01:15,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:01:15,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:01:15,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780379241] [2025-03-08 01:01:15,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:01:15,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:01:15,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:01:15,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:01:15,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:15,922 INFO L87 Difference]: Start difference. First operand 281279 states and 308640 transitions. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 2 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:18,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:01:18,687 INFO L93 Difference]: Finished difference Result 835067 states and 916519 transitions. [2025-03-08 01:01:18,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:01:18,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 2 states have internal predecessors, (282), 0 states have call successors, (0), 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 364 [2025-03-08 01:01:18,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:01:19,539 INFO L225 Difference]: With dead ends: 835067 [2025-03-08 01:01:19,540 INFO L226 Difference]: Without dead ends: 553790 [2025-03-08 01:01:19,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:19,680 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 211 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:01:19,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 525 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:01:20,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553790 states. [2025-03-08 01:01:25,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553790 to 553772. [2025-03-08 01:01:26,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553772 states, 553771 states have (on average 1.0973037591350938) internal successors, (607655), 553771 states have internal predecessors, (607655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553772 states to 553772 states and 607655 transitions. [2025-03-08 01:01:26,848 INFO L78 Accepts]: Start accepts. Automaton has 553772 states and 607655 transitions. Word has length 364 [2025-03-08 01:01:26,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:01:26,849 INFO L471 AbstractCegarLoop]: Abstraction has 553772 states and 607655 transitions. [2025-03-08 01:01:26,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 2 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:26,849 INFO L276 IsEmpty]: Start isEmpty. Operand 553772 states and 607655 transitions. [2025-03-08 01:01:26,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-03-08 01:01:26,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:01:26,878 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:01:26,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 01:01:26,878 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:01:26,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:01:26,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1335187042, now seen corresponding path program 1 times [2025-03-08 01:01:26,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:01:26,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279163] [2025-03-08 01:01:26,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:26,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:01:26,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-08 01:01:26,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-08 01:01:26,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:26,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat