./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label23.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem14_label23.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 fd73ab074a990e2fba4a8f87029e18649db9146d39c1908dcf3532d41f095922 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:06:00,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:06:00,067 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:06:00,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:06:00,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:06:00,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:06:00,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:06:00,094 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:06:00,094 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:06:00,094 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:06:00,095 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:06:00,095 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:06:00,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:06:00,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:06:00,095 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:06:00,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:06:00,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:06:00,095 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:06:00,095 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:06:00,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:06:00,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:06:00,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:06:00,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:06:00,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:06:00,095 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:06:00,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:06:00,096 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:06:00,096 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:06:00,096 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:06:00,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:06:00,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:06:00,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:06:00,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:06:00,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:06:00,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:06:00,096 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:06:00,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:06:00,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:06:00,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:06:00,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:06:00,097 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:06:00,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:06:00,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:06:00,097 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 -> fd73ab074a990e2fba4a8f87029e18649db9146d39c1908dcf3532d41f095922 [2025-03-16 15:06:00,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:06:00,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:06:00,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:06:00,320 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:06:00,320 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:06:00,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label23.c [2025-03-16 15:06:01,440 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ffffe188/5489dbcc44644c25815a9815dc6f2771/FLAG6c9bfa62b [2025-03-16 15:06:01,802 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:06:01,803 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label23.c [2025-03-16 15:06:01,820 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ffffe188/5489dbcc44644c25815a9815dc6f2771/FLAG6c9bfa62b [2025-03-16 15:06:02,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ffffe188/5489dbcc44644c25815a9815dc6f2771 [2025-03-16 15:06:02,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:06:02,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:06:02,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:06:02,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:06:02,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:06:02,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@652ce60b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02, skipping insertion in model container [2025-03-16 15:06:02,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,073 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:06:02,195 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label23.c[3423,3436] [2025-03-16 15:06:02,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:06:02,315 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:06:02,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label23.c[3423,3436] [2025-03-16 15:06:02,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:06:02,388 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:06:02,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02 WrapperNode [2025-03-16 15:06:02,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:06:02,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:06:02,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:06:02,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:06:02,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,469 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-03-16 15:06:02,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:06:02,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:06:02,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:06:02,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:06:02,478 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,483 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,509 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-16 15:06:02,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,531 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:06:02,564 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:06:02,564 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:06:02,564 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:06:02,565 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:06:02,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:02,593 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-16 15:06:02,597 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-16 15:06:02,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:06:02,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:06:02,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:06:02,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:06:02,666 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:06:02,668 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:06:03,647 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-16 15:06:03,647 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:06:03,658 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:06:03,659 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:06:03,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:06:03 BoogieIcfgContainer [2025-03-16 15:06:03,659 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:06:03,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:06:03,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:06:03,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:06:03,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:06:02" (1/3) ... [2025-03-16 15:06:03,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30908f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:06:03, skipping insertion in model container [2025-03-16 15:06:03,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (2/3) ... [2025-03-16 15:06:03,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30908f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:06:03, skipping insertion in model container [2025-03-16 15:06:03,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:06:03" (3/3) ... [2025-03-16 15:06:03,668 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label23.c [2025-03-16 15:06:03,679 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:06:03,680 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label23.c that has 1 procedures, 184 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:06:03,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:06:03,732 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;@14b34d36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:06:03,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:06:03,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 184 states, 182 states have (on average 1.978021978021978) internal successors, (360), 183 states have internal predecessors, (360), 0 states have call successors, (0), 0 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-16 15:06:03,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 15:06:03,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:03,744 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] [2025-03-16 15:06:03,744 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:03,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:03,750 INFO L85 PathProgramCache]: Analyzing trace with hash 595001060, now seen corresponding path program 1 times [2025-03-16 15:06:03,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:03,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277790379] [2025-03-16 15:06:03,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:03,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:03,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 15:06:03,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 15:06:03,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:03,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:03,858 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-16 15:06:03,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:03,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277790379] [2025-03-16 15:06:03,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277790379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:03,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:03,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:06:03,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243013533] [2025-03-16 15:06:03,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:03,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:06:03,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:03,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:06:03,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:06:03,882 INFO L87 Difference]: Start difference. First operand has 184 states, 182 states have (on average 1.978021978021978) internal successors, (360), 183 states have internal predecessors, (360), 0 states have call successors, (0), 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 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-16 15:06:03,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:03,912 INFO L93 Difference]: Finished difference Result 367 states and 719 transitions. [2025-03-16 15:06:03,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:06:03,915 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2025-03-16 15:06:03,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:03,922 INFO L225 Difference]: With dead ends: 367 [2025-03-16 15:06:03,922 INFO L226 Difference]: Without dead ends: 181 [2025-03-16 15:06:03,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:06:03,926 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:03,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:06:03,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-16 15:06:03,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-16 15:06:03,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2025-03-16 15:06:03,969 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 31 [2025-03-16 15:06:03,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:03,969 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2025-03-16 15:06:03,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-16 15:06:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2025-03-16 15:06:03,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 15:06:03,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:03,970 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] [2025-03-16 15:06:03,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:06:03,970 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:03,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:03,972 INFO L85 PathProgramCache]: Analyzing trace with hash -572846463, now seen corresponding path program 1 times [2025-03-16 15:06:03,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:03,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386950852] [2025-03-16 15:06:03,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:03,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:03,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 15:06:04,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 15:06:04,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:04,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:04,130 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-16 15:06:04,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:04,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386950852] [2025-03-16 15:06:04,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386950852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:04,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:04,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:06:04,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356219935] [2025-03-16 15:06:04,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:04,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:04,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:04,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:04,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:04,142 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-16 15:06:04,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:04,694 INFO L93 Difference]: Finished difference Result 361 states and 589 transitions. [2025-03-16 15:06:04,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:04,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2025-03-16 15:06:04,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:04,696 INFO L225 Difference]: With dead ends: 361 [2025-03-16 15:06:04,696 INFO L226 Difference]: Without dead ends: 359 [2025-03-16 15:06:04,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-16 15:06:04,697 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 170 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:04,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 11 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:06:04,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-16 15:06:04,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-03-16 15:06:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.6396648044692737) internal successors, (587), 358 states have internal predecessors, (587), 0 states have call successors, (0), 0 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-16 15:06:04,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 587 transitions. [2025-03-16 15:06:04,723 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 587 transitions. Word has length 31 [2025-03-16 15:06:04,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:04,724 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 587 transitions. [2025-03-16 15:06:04,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-16 15:06:04,724 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 587 transitions. [2025-03-16 15:06:04,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 15:06:04,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:04,727 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:06:04,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:06:04,728 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:04,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:04,728 INFO L85 PathProgramCache]: Analyzing trace with hash -104908930, now seen corresponding path program 1 times [2025-03-16 15:06:04,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:04,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779771686] [2025-03-16 15:06:04,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:04,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:04,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 15:06:04,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 15:06:04,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:04,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:04,913 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:06:04,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:04,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779771686] [2025-03-16 15:06:04,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779771686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:04,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:04,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:06:04,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860140907] [2025-03-16 15:06:04,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:04,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:04,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:04,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:04,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:04,917 INFO L87 Difference]: Start difference. First operand 359 states and 587 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:05,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:05,502 INFO L93 Difference]: Finished difference Result 1075 states and 1759 transitions. [2025-03-16 15:06:05,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:05,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-16 15:06:05,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:05,506 INFO L225 Difference]: With dead ends: 1075 [2025-03-16 15:06:05,506 INFO L226 Difference]: Without dead ends: 717 [2025-03-16 15:06:05,510 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-16 15:06:05,510 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 134 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:05,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 87 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:06:05,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-03-16 15:06:05,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2025-03-16 15:06:05,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.42296918767507) internal successors, (1016), 714 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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-16 15:06:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1016 transitions. [2025-03-16 15:06:05,548 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1016 transitions. Word has length 96 [2025-03-16 15:06:05,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:05,549 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1016 transitions. [2025-03-16 15:06:05,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:05,550 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1016 transitions. [2025-03-16 15:06:05,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 15:06:05,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:05,551 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:06:05,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:06:05,552 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:05,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:05,553 INFO L85 PathProgramCache]: Analyzing trace with hash -601566439, now seen corresponding path program 1 times [2025-03-16 15:06:05,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:05,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875299537] [2025-03-16 15:06:05,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:05,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:05,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 15:06:05,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 15:06:05,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:05,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:06:05,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:05,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875299537] [2025-03-16 15:06:05,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875299537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:05,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:05,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:06:05,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422799555] [2025-03-16 15:06:05,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:05,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:05,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:05,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:05,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:05,712 INFO L87 Difference]: Start difference. First operand 715 states and 1016 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 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-16 15:06:06,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:06,232 INFO L93 Difference]: Finished difference Result 1607 states and 2323 transitions. [2025-03-16 15:06:06,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:06,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-16 15:06:06,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:06,236 INFO L225 Difference]: With dead ends: 1607 [2025-03-16 15:06:06,236 INFO L226 Difference]: Without dead ends: 893 [2025-03-16 15:06:06,237 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-16 15:06:06,237 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:06,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 56 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:06:06,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2025-03-16 15:06:06,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 893. [2025-03-16 15:06:06,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 1.3318385650224216) internal successors, (1188), 892 states have internal predecessors, (1188), 0 states have call successors, (0), 0 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-16 15:06:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1188 transitions. [2025-03-16 15:06:06,263 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1188 transitions. Word has length 97 [2025-03-16 15:06:06,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:06,264 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1188 transitions. [2025-03-16 15:06:06,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 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-16 15:06:06,264 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1188 transitions. [2025-03-16 15:06:06,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 15:06:06,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:06,265 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:06:06,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:06:06,265 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:06,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:06,266 INFO L85 PathProgramCache]: Analyzing trace with hash -956806732, now seen corresponding path program 1 times [2025-03-16 15:06:06,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:06,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144890877] [2025-03-16 15:06:06,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:06,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:06,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 15:06:06,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 15:06:06,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:06,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:06,478 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:06:06,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:06,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144890877] [2025-03-16 15:06:06,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144890877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:06,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:06,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:06,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121344205] [2025-03-16 15:06:06,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:06,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:06:06,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:06,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:06:06,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:06:06,479 INFO L87 Difference]: Start difference. First operand 893 states and 1188 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 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-16 15:06:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:07,195 INFO L93 Difference]: Finished difference Result 2143 states and 2781 transitions. [2025-03-16 15:06:07,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:06:07,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-03-16 15:06:07,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:07,199 INFO L225 Difference]: With dead ends: 2143 [2025-03-16 15:06:07,199 INFO L226 Difference]: Without dead ends: 1251 [2025-03-16 15:06:07,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:06:07,200 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 440 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:07,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 122 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:06:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2025-03-16 15:06:07,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1249. [2025-03-16 15:06:07,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 1.2572115384615385) internal successors, (1569), 1248 states have internal predecessors, (1569), 0 states have call successors, (0), 0 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-16 15:06:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1569 transitions. [2025-03-16 15:06:07,222 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1569 transitions. Word has length 100 [2025-03-16 15:06:07,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:07,223 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1569 transitions. [2025-03-16 15:06:07,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 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-16 15:06:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1569 transitions. [2025-03-16 15:06:07,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 15:06:07,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:07,224 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:06:07,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:06:07,224 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:07,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:07,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1604234954, now seen corresponding path program 1 times [2025-03-16 15:06:07,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:07,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686646630] [2025-03-16 15:06:07,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:07,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:07,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 15:06:07,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 15:06:07,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:07,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:07,431 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:06:07,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:07,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686646630] [2025-03-16 15:06:07,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686646630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:07,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:07,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:07,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269153501] [2025-03-16 15:06:07,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:07,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:06:07,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:07,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:06:07,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:06:07,435 INFO L87 Difference]: Start difference. First operand 1249 states and 1569 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-16 15:06:08,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:08,006 INFO L93 Difference]: Finished difference Result 2884 states and 3572 transitions. [2025-03-16 15:06:08,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:06:08,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-03-16 15:06:08,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:08,012 INFO L225 Difference]: With dead ends: 2884 [2025-03-16 15:06:08,012 INFO L226 Difference]: Without dead ends: 1607 [2025-03-16 15:06:08,013 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-16 15:06:08,015 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 112 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:08,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 119 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:06:08,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2025-03-16 15:06:08,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1605. [2025-03-16 15:06:08,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.1315461346633418) internal successors, (1815), 1604 states have internal predecessors, (1815), 0 states have call successors, (0), 0 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-16 15:06:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1815 transitions. [2025-03-16 15:06:08,047 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1815 transitions. Word has length 111 [2025-03-16 15:06:08,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:08,048 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 1815 transitions. [2025-03-16 15:06:08,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-16 15:06:08,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1815 transitions. [2025-03-16 15:06:08,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-16 15:06:08,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:08,051 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:06:08,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:06:08,052 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:08,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:08,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1127732677, now seen corresponding path program 1 times [2025-03-16 15:06:08,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:08,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890766789] [2025-03-16 15:06:08,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:08,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:08,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-16 15:06:08,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-16 15:06:08,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:08,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:08,250 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:06:08,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:08,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890766789] [2025-03-16 15:06:08,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890766789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:08,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:08,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:08,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825011192] [2025-03-16 15:06:08,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:08,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:08,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:08,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:08,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:08,251 INFO L87 Difference]: Start difference. First operand 1605 states and 1815 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 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-16 15:06:08,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:08,682 INFO L93 Difference]: Finished difference Result 3921 states and 4493 transitions. [2025-03-16 15:06:08,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:08,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2025-03-16 15:06:08,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:08,689 INFO L225 Difference]: With dead ends: 3921 [2025-03-16 15:06:08,689 INFO L226 Difference]: Without dead ends: 2317 [2025-03-16 15:06:08,690 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-16 15:06:08,691 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:08,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 76 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:08,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2025-03-16 15:06:08,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2139. [2025-03-16 15:06:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 1.117399438727783) internal successors, (2389), 2138 states have internal predecessors, (2389), 0 states have call successors, (0), 0 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-16 15:06:08,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2389 transitions. [2025-03-16 15:06:08,725 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2389 transitions. Word has length 205 [2025-03-16 15:06:08,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:08,725 INFO L471 AbstractCegarLoop]: Abstraction has 2139 states and 2389 transitions. [2025-03-16 15:06:08,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 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-16 15:06:08,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2389 transitions. [2025-03-16 15:06:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-16 15:06:08,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:08,728 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:08,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:06:08,728 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:08,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:08,729 INFO L85 PathProgramCache]: Analyzing trace with hash 559145371, now seen corresponding path program 1 times [2025-03-16 15:06:08,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:08,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789606402] [2025-03-16 15:06:08,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:08,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:08,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-16 15:06:08,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-16 15:06:08,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:08,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:08,970 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2025-03-16 15:06:08,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:08,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789606402] [2025-03-16 15:06:08,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789606402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:08,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:08,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:08,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593995162] [2025-03-16 15:06:08,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:08,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:06:08,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:08,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:06:08,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:06:08,972 INFO L87 Difference]: Start difference. First operand 2139 states and 2389 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 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-16 15:06:09,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:09,459 INFO L93 Difference]: Finished difference Result 4335 states and 4859 transitions. [2025-03-16 15:06:09,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:06:09,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 322 [2025-03-16 15:06:09,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:09,466 INFO L225 Difference]: With dead ends: 4335 [2025-03-16 15:06:09,466 INFO L226 Difference]: Without dead ends: 2317 [2025-03-16 15:06:09,468 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-16 15:06:09,468 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:09,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 15 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:06:09,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2025-03-16 15:06:09,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2139. [2025-03-16 15:06:09,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 1.077642656688494) internal successors, (2304), 2138 states have internal predecessors, (2304), 0 states have call successors, (0), 0 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-16 15:06:09,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2304 transitions. [2025-03-16 15:06:09,498 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2304 transitions. Word has length 322 [2025-03-16 15:06:09,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:09,498 INFO L471 AbstractCegarLoop]: Abstraction has 2139 states and 2304 transitions. [2025-03-16 15:06:09,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 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-16 15:06:09,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2304 transitions. [2025-03-16 15:06:09,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-03-16 15:06:09,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:09,502 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-16 15:06:09,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:06:09,502 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:09,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:09,502 INFO L85 PathProgramCache]: Analyzing trace with hash 2121137659, now seen corresponding path program 1 times [2025-03-16 15:06:09,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:09,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158269153] [2025-03-16 15:06:09,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:09,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:09,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-03-16 15:06:09,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-03-16 15:06:09,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:09,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:09,839 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 15:06:09,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:09,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158269153] [2025-03-16 15:06:09,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158269153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:09,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:09,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:09,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553563595] [2025-03-16 15:06:09,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:09,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:09,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:09,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:09,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:09,843 INFO L87 Difference]: Start difference. First operand 2139 states and 2304 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 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-16 15:06:10,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:10,236 INFO L93 Difference]: Finished difference Result 4455 states and 4865 transitions. [2025-03-16 15:06:10,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:10,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 417 [2025-03-16 15:06:10,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:10,242 INFO L225 Difference]: With dead ends: 4455 [2025-03-16 15:06:10,243 INFO L226 Difference]: Without dead ends: 2495 [2025-03-16 15:06:10,245 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-16 15:06:10,245 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 111 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:10,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 242 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:10,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2025-03-16 15:06:10,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 1961. [2025-03-16 15:06:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1960 states have (on average 1.0775510204081633) internal successors, (2112), 1960 states have internal predecessors, (2112), 0 states have call successors, (0), 0 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-16 15:06:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2112 transitions. [2025-03-16 15:06:10,273 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2112 transitions. Word has length 417 [2025-03-16 15:06:10,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:10,273 INFO L471 AbstractCegarLoop]: Abstraction has 1961 states and 2112 transitions. [2025-03-16 15:06:10,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 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-16 15:06:10,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2112 transitions. [2025-03-16 15:06:10,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-03-16 15:06:10,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:10,280 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:10,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:06:10,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:10,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:10,284 INFO L85 PathProgramCache]: Analyzing trace with hash -427348492, now seen corresponding path program 1 times [2025-03-16 15:06:10,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:10,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491035842] [2025-03-16 15:06:10,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:10,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:10,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-03-16 15:06:10,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-03-16 15:06:10,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:10,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 15:06:10,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:10,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491035842] [2025-03-16 15:06:10,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491035842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:10,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:10,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:10,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684364093] [2025-03-16 15:06:10,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:10,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:10,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:10,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:10,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:10,630 INFO L87 Difference]: Start difference. First operand 1961 states and 2112 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 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-16 15:06:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:11,005 INFO L93 Difference]: Finished difference Result 4277 states and 4684 transitions. [2025-03-16 15:06:11,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:11,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 424 [2025-03-16 15:06:11,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:11,012 INFO L225 Difference]: With dead ends: 4277 [2025-03-16 15:06:11,012 INFO L226 Difference]: Without dead ends: 2495 [2025-03-16 15:06:11,014 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-16 15:06:11,014 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 113 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:11,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 218 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:11,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2025-03-16 15:06:11,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2139. [2025-03-16 15:06:11,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 1.086997193638915) internal successors, (2324), 2138 states have internal predecessors, (2324), 0 states have call successors, (0), 0 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-16 15:06:11,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2324 transitions. [2025-03-16 15:06:11,052 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2324 transitions. Word has length 424 [2025-03-16 15:06:11,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:11,052 INFO L471 AbstractCegarLoop]: Abstraction has 2139 states and 2324 transitions. [2025-03-16 15:06:11,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 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-16 15:06:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2324 transitions. [2025-03-16 15:06:11,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-16 15:06:11,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:11,057 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:11,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:06:11,057 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:11,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:11,058 INFO L85 PathProgramCache]: Analyzing trace with hash 111725803, now seen corresponding path program 1 times [2025-03-16 15:06:11,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:11,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366134656] [2025-03-16 15:06:11,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:11,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:11,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-16 15:06:11,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-16 15:06:11,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:11,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:11,246 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 15:06:11,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:11,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366134656] [2025-03-16 15:06:11,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366134656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:11,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:11,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:11,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866218064] [2025-03-16 15:06:11,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:11,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:11,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:11,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:11,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:11,247 INFO L87 Difference]: Start difference. First operand 2139 states and 2324 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 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-16 15:06:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:11,668 INFO L93 Difference]: Finished difference Result 4989 states and 5477 transitions. [2025-03-16 15:06:11,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:11,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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 465 [2025-03-16 15:06:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:11,677 INFO L225 Difference]: With dead ends: 4989 [2025-03-16 15:06:11,677 INFO L226 Difference]: Without dead ends: 3029 [2025-03-16 15:06:11,679 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-16 15:06:11,679 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 73 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:11,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 49 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:11,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029 states. [2025-03-16 15:06:11,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3029 to 3029. [2025-03-16 15:06:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3029 states, 3028 states have (on average 1.08223249669749) internal successors, (3277), 3028 states have internal predecessors, (3277), 0 states have call successors, (0), 0 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-16 15:06:11,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3029 states to 3029 states and 3277 transitions. [2025-03-16 15:06:11,725 INFO L78 Accepts]: Start accepts. Automaton has 3029 states and 3277 transitions. Word has length 465 [2025-03-16 15:06:11,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:11,726 INFO L471 AbstractCegarLoop]: Abstraction has 3029 states and 3277 transitions. [2025-03-16 15:06:11,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 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-16 15:06:11,726 INFO L276 IsEmpty]: Start isEmpty. Operand 3029 states and 3277 transitions. [2025-03-16 15:06:11,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-03-16 15:06:11,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:11,733 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:11,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:06:11,733 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:11,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:11,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1945592117, now seen corresponding path program 1 times [2025-03-16 15:06:11,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:11,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267178407] [2025-03-16 15:06:11,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:11,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:11,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-03-16 15:06:11,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-03-16 15:06:11,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:11,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:12,070 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 15:06:12,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:12,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267178407] [2025-03-16 15:06:12,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267178407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:12,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:12,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:06:12,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612056103] [2025-03-16 15:06:12,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:12,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:06:12,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:12,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:06:12,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:06:12,072 INFO L87 Difference]: Start difference. First operand 3029 states and 3277 transitions. Second operand has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:12,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:12,674 INFO L93 Difference]: Finished difference Result 6413 states and 6951 transitions. [2025-03-16 15:06:12,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:06:12,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 501 [2025-03-16 15:06:12,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:12,682 INFO L225 Difference]: With dead ends: 6413 [2025-03-16 15:06:12,682 INFO L226 Difference]: Without dead ends: 3563 [2025-03-16 15:06:12,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:06:12,685 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 213 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:12,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 65 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:06:12,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2025-03-16 15:06:12,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 3385. [2025-03-16 15:06:12,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 3384 states have (on average 1.0729905437352245) internal successors, (3631), 3384 states have internal predecessors, (3631), 0 states have call successors, (0), 0 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-16 15:06:12,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 3631 transitions. [2025-03-16 15:06:12,723 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 3631 transitions. Word has length 501 [2025-03-16 15:06:12,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:12,723 INFO L471 AbstractCegarLoop]: Abstraction has 3385 states and 3631 transitions. [2025-03-16 15:06:12,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 3631 transitions. [2025-03-16 15:06:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-03-16 15:06:12,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:12,727 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:12,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:06:12,727 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:12,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:12,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1071867336, now seen corresponding path program 1 times [2025-03-16 15:06:12,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:12,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705196550] [2025-03-16 15:06:12,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:12,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:12,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-16 15:06:12,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-16 15:06:12,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:12,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1061 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-03-16 15:06:13,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:13,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705196550] [2025-03-16 15:06:13,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705196550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:13,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:13,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:13,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278173998] [2025-03-16 15:06:13,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:13,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:13,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:13,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:13,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:13,066 INFO L87 Difference]: Start difference. First operand 3385 states and 3631 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 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-16 15:06:13,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:13,468 INFO L93 Difference]: Finished difference Result 7125 states and 7722 transitions. [2025-03-16 15:06:13,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:13,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 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 579 [2025-03-16 15:06:13,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:13,476 INFO L225 Difference]: With dead ends: 7125 [2025-03-16 15:06:13,476 INFO L226 Difference]: Without dead ends: 3919 [2025-03-16 15:06:13,479 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-16 15:06:13,479 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:13,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 225 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:13,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2025-03-16 15:06:13,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3741. [2025-03-16 15:06:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 3740 states have (on average 1.0684491978609625) internal successors, (3996), 3740 states have internal predecessors, (3996), 0 states have call successors, (0), 0 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-16 15:06:13,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 3996 transitions. [2025-03-16 15:06:13,523 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 3996 transitions. Word has length 579 [2025-03-16 15:06:13,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:13,523 INFO L471 AbstractCegarLoop]: Abstraction has 3741 states and 3996 transitions. [2025-03-16 15:06:13,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 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-16 15:06:13,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 3996 transitions. [2025-03-16 15:06:13,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2025-03-16 15:06:13,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:13,528 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:13,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:06:13,528 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:13,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:13,529 INFO L85 PathProgramCache]: Analyzing trace with hash -503382745, now seen corresponding path program 1 times [2025-03-16 15:06:13,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:13,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818738401] [2025-03-16 15:06:13,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:13,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:13,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 620 statements into 1 equivalence classes. [2025-03-16 15:06:13,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 620 of 620 statements. [2025-03-16 15:06:13,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:13,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 792 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 15:06:13,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:13,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818738401] [2025-03-16 15:06:13,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818738401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:13,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100904851] [2025-03-16 15:06:13,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:13,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:13,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:13,816 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-16 15:06:13,818 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-16 15:06:13,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 620 statements into 1 equivalence classes. [2025-03-16 15:06:13,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 620 of 620 statements. [2025-03-16 15:06:13,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:13,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:14,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:06:14,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:14,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2025-03-16 15:06:14,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:06:14,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100904851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:14,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:06:14,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 15:06:14,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964225647] [2025-03-16 15:06:14,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:14,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:14,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:14,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:14,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:06:14,102 INFO L87 Difference]: Start difference. First operand 3741 states and 3996 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:14,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:14,456 INFO L93 Difference]: Finished difference Result 8549 states and 9125 transitions. [2025-03-16 15:06:14,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:14,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 620 [2025-03-16 15:06:14,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:14,468 INFO L225 Difference]: With dead ends: 8549 [2025-03-16 15:06:14,468 INFO L226 Difference]: Without dead ends: 4097 [2025-03-16 15:06:14,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 620 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:06:14,472 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 149 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:14,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 239 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:06:14,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4097 states. [2025-03-16 15:06:14,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4097 to 3741. [2025-03-16 15:06:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 3740 states have (on average 1.0622994652406417) internal successors, (3973), 3740 states have internal predecessors, (3973), 0 states have call successors, (0), 0 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-16 15:06:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 3973 transitions. [2025-03-16 15:06:14,509 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 3973 transitions. Word has length 620 [2025-03-16 15:06:14,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:14,510 INFO L471 AbstractCegarLoop]: Abstraction has 3741 states and 3973 transitions. [2025-03-16 15:06:14,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 3973 transitions. [2025-03-16 15:06:14,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2025-03-16 15:06:14,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:14,514 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:14,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 15:06:14,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 15:06:14,715 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:14,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:14,715 INFO L85 PathProgramCache]: Analyzing trace with hash -845744683, now seen corresponding path program 1 times [2025-03-16 15:06:14,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:14,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896927989] [2025-03-16 15:06:14,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:14,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:14,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-03-16 15:06:14,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-03-16 15:06:14,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:14,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:14,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 1186 proven. 110 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2025-03-16 15:06:14,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:14,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896927989] [2025-03-16 15:06:14,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896927989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:14,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24431464] [2025-03-16 15:06:14,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:14,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:14,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:14,992 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-16 15:06:14,994 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-16 15:06:15,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-03-16 15:06:15,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-03-16 15:06:15,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:15,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:15,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:06:15,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 1186 proven. 110 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2025-03-16 15:06:15,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:06:15,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 1186 proven. 110 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2025-03-16 15:06:15,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24431464] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:06:15,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:06:15,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 15:06:15,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563630686] [2025-03-16 15:06:15,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:06:15,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 15:06:15,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:15,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 15:06:15,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:06:15,715 INFO L87 Difference]: Start difference. First operand 3741 states and 3973 transitions. Second operand has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 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-16 15:06:16,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:16,442 INFO L93 Difference]: Finished difference Result 8905 states and 9461 transitions. [2025-03-16 15:06:16,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:06:16,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 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 699 [2025-03-16 15:06:16,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:16,454 INFO L225 Difference]: With dead ends: 8905 [2025-03-16 15:06:16,455 INFO L226 Difference]: Without dead ends: 5343 [2025-03-16 15:06:16,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1400 GetRequests, 1396 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:06:16,458 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 298 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:16,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 61 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:06:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5343 states. [2025-03-16 15:06:16,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5343 to 4453. [2025-03-16 15:06:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4453 states, 4452 states have (on average 1.0604222821203952) internal successors, (4721), 4452 states have internal predecessors, (4721), 0 states have call successors, (0), 0 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-16 15:06:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4453 states to 4453 states and 4721 transitions. [2025-03-16 15:06:16,503 INFO L78 Accepts]: Start accepts. Automaton has 4453 states and 4721 transitions. Word has length 699 [2025-03-16 15:06:16,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:16,504 INFO L471 AbstractCegarLoop]: Abstraction has 4453 states and 4721 transitions. [2025-03-16 15:06:16,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 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-16 15:06:16,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4453 states and 4721 transitions. [2025-03-16 15:06:16,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2025-03-16 15:06:16,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:16,508 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:16,515 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-16 15:06:16,713 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,SelfDestructingSolverStorable14 [2025-03-16 15:06:16,713 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:16,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:16,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1188334946, now seen corresponding path program 1 times [2025-03-16 15:06:16,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:16,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076663416] [2025-03-16 15:06:16,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:16,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:16,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 758 statements into 1 equivalence classes. [2025-03-16 15:06:16,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 758 of 758 statements. [2025-03-16 15:06:16,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:16,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:17,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1688 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-16 15:06:17,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:17,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076663416] [2025-03-16 15:06:17,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076663416] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:17,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846540081] [2025-03-16 15:06:17,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:17,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:17,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:17,344 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-16 15:06:17,347 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-16 15:06:17,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 758 statements into 1 equivalence classes. [2025-03-16 15:06:17,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 758 of 758 statements. [2025-03-16 15:06:17,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:17,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:17,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:06:17,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:19,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1688 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 1259 trivial. 0 not checked. [2025-03-16 15:06:19,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:06:19,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846540081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:19,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:06:19,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:06:19,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927838006] [2025-03-16 15:06:19,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:19,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:06:19,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:19,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:06:19,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:06:19,414 INFO L87 Difference]: Start difference. First operand 4453 states and 4721 transitions. Second operand has 4 states, 4 states have (on average 64.0) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 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-16 15:06:19,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:19,815 INFO L93 Difference]: Finished difference Result 8934 states and 9474 transitions. [2025-03-16 15:06:19,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:06:19,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 758 [2025-03-16 15:06:19,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:19,825 INFO L225 Difference]: With dead ends: 8934 [2025-03-16 15:06:19,825 INFO L226 Difference]: Without dead ends: 4453 [2025-03-16 15:06:19,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 762 GetRequests, 756 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:06:19,829 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 130 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:19,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 45 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:19,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4453 states. [2025-03-16 15:06:19,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4453 to 4453. [2025-03-16 15:06:19,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4453 states, 4452 states have (on average 1.044249775381851) internal successors, (4649), 4452 states have internal predecessors, (4649), 0 states have call successors, (0), 0 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-16 15:06:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4453 states to 4453 states and 4649 transitions. [2025-03-16 15:06:19,865 INFO L78 Accepts]: Start accepts. Automaton has 4453 states and 4649 transitions. Word has length 758 [2025-03-16 15:06:19,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:19,866 INFO L471 AbstractCegarLoop]: Abstraction has 4453 states and 4649 transitions. [2025-03-16 15:06:19,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 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-16 15:06:19,866 INFO L276 IsEmpty]: Start isEmpty. Operand 4453 states and 4649 transitions. [2025-03-16 15:06:19,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 935 [2025-03-16 15:06:19,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:19,872 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:19,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 15:06:20,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:20,076 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:20,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:20,076 INFO L85 PathProgramCache]: Analyzing trace with hash 753189474, now seen corresponding path program 1 times [2025-03-16 15:06:20,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:20,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775393037] [2025-03-16 15:06:20,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:20,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:20,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 934 statements into 1 equivalence classes. [2025-03-16 15:06:20,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 934 of 934 statements. [2025-03-16 15:06:20,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:20,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:20,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2745 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 2506 trivial. 0 not checked. [2025-03-16 15:06:20,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:20,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775393037] [2025-03-16 15:06:20,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775393037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:20,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:20,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:20,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362221540] [2025-03-16 15:06:20,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:20,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:20,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:20,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:20,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:20,404 INFO L87 Difference]: Start difference. First operand 4453 states and 4649 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 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-16 15:06:20,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:20,710 INFO L93 Difference]: Finished difference Result 5167 states and 5385 transitions. [2025-03-16 15:06:20,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:20,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 934 [2025-03-16 15:06:20,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:20,718 INFO L225 Difference]: With dead ends: 5167 [2025-03-16 15:06:20,718 INFO L226 Difference]: Without dead ends: 5165 [2025-03-16 15:06:20,719 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-16 15:06:20,719 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 169 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:20,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 10 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:06:20,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2025-03-16 15:06:20,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 4453. [2025-03-16 15:06:20,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4453 states, 4452 states have (on average 1.0438005390835579) internal successors, (4647), 4452 states have internal predecessors, (4647), 0 states have call successors, (0), 0 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-16 15:06:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4453 states to 4453 states and 4647 transitions. [2025-03-16 15:06:20,758 INFO L78 Accepts]: Start accepts. Automaton has 4453 states and 4647 transitions. Word has length 934 [2025-03-16 15:06:20,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:20,758 INFO L471 AbstractCegarLoop]: Abstraction has 4453 states and 4647 transitions. [2025-03-16 15:06:20,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 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-16 15:06:20,758 INFO L276 IsEmpty]: Start isEmpty. Operand 4453 states and 4647 transitions. [2025-03-16 15:06:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 998 [2025-03-16 15:06:20,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:20,765 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:20,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:06:20,765 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:20,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:20,766 INFO L85 PathProgramCache]: Analyzing trace with hash 270443650, now seen corresponding path program 1 times [2025-03-16 15:06:20,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:20,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657958244] [2025-03-16 15:06:20,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:20,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:20,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 997 statements into 1 equivalence classes. [2025-03-16 15:06:20,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 997 of 997 statements. [2025-03-16 15:06:20,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:20,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3297 backedges. 828 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2025-03-16 15:06:21,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:21,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657958244] [2025-03-16 15:06:21,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657958244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:21,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:21,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:21,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917774283] [2025-03-16 15:06:21,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:21,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:21,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:21,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:21,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:21,398 INFO L87 Difference]: Start difference. First operand 4453 states and 4647 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 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-16 15:06:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:21,698 INFO L93 Difference]: Finished difference Result 8727 states and 9114 transitions. [2025-03-16 15:06:21,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:21,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 997 [2025-03-16 15:06:21,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:21,703 INFO L225 Difference]: With dead ends: 8727 [2025-03-16 15:06:21,703 INFO L226 Difference]: Without dead ends: 4453 [2025-03-16 15:06:21,706 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-16 15:06:21,706 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:21,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 225 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:06:21,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4453 states. [2025-03-16 15:06:21,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4453 to 4453. [2025-03-16 15:06:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4453 states, 4452 states have (on average 1.039757412398922) internal successors, (4629), 4452 states have internal predecessors, (4629), 0 states have call successors, (0), 0 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-16 15:06:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4453 states to 4453 states and 4629 transitions. [2025-03-16 15:06:21,736 INFO L78 Accepts]: Start accepts. Automaton has 4453 states and 4629 transitions. Word has length 997 [2025-03-16 15:06:21,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:21,736 INFO L471 AbstractCegarLoop]: Abstraction has 4453 states and 4629 transitions. [2025-03-16 15:06:21,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 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-16 15:06:21,737 INFO L276 IsEmpty]: Start isEmpty. Operand 4453 states and 4629 transitions. [2025-03-16 15:06:21,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1046 [2025-03-16 15:06:21,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:21,743 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:21,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:06:21,743 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:21,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:21,744 INFO L85 PathProgramCache]: Analyzing trace with hash 38469386, now seen corresponding path program 1 times [2025-03-16 15:06:21,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:21,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031706803] [2025-03-16 15:06:21,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:21,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:21,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1045 statements into 1 equivalence classes. [2025-03-16 15:06:21,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1045 of 1045 statements. [2025-03-16 15:06:21,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:21,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3494 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 3225 trivial. 0 not checked. [2025-03-16 15:06:22,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:22,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031706803] [2025-03-16 15:06:22,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031706803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:22,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:22,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:22,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473337790] [2025-03-16 15:06:22,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:22,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:22,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:22,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:22,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:22,472 INFO L87 Difference]: Start difference. First operand 4453 states and 4629 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 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-16 15:06:22,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:22,762 INFO L93 Difference]: Finished difference Result 4811 states and 5039 transitions. [2025-03-16 15:06:22,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:22,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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 1045 [2025-03-16 15:06:22,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:22,768 INFO L225 Difference]: With dead ends: 4811 [2025-03-16 15:06:22,768 INFO L226 Difference]: Without dead ends: 4809 [2025-03-16 15:06:22,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-16 15:06:22,770 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 151 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:22,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 14 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:06:22,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2025-03-16 15:06:22,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4275. [2025-03-16 15:06:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4275 states, 4274 states have (on average 1.0383715489003276) internal successors, (4438), 4274 states have internal predecessors, (4438), 0 states have call successors, (0), 0 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-16 15:06:22,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 4438 transitions. [2025-03-16 15:06:22,803 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 4438 transitions. Word has length 1045 [2025-03-16 15:06:22,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:22,804 INFO L471 AbstractCegarLoop]: Abstraction has 4275 states and 4438 transitions. [2025-03-16 15:06:22,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 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-16 15:06:22,804 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 4438 transitions. [2025-03-16 15:06:22,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1055 [2025-03-16 15:06:22,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:22,810 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:22,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:06:22,811 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:22,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:22,812 INFO L85 PathProgramCache]: Analyzing trace with hash 4400928, now seen corresponding path program 1 times [2025-03-16 15:06:22,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:22,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332817703] [2025-03-16 15:06:22,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:22,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:22,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1054 statements into 1 equivalence classes. [2025-03-16 15:06:22,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1054 of 1054 statements. [2025-03-16 15:06:22,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:22,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:23,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3557 backedges. 1609 proven. 0 refuted. 0 times theorem prover too weak. 1948 trivial. 0 not checked. [2025-03-16 15:06:23,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:23,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332817703] [2025-03-16 15:06:23,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332817703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:23,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:23,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:06:23,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142614936] [2025-03-16 15:06:23,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:23,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:06:23,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:23,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:06:23,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:06:23,503 INFO L87 Difference]: Start difference. First operand 4275 states and 4438 transitions. Second operand has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 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-16 15:06:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:24,078 INFO L93 Difference]: Finished difference Result 8549 states and 8916 transitions. [2025-03-16 15:06:24,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:06:24,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 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 1054 [2025-03-16 15:06:24,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:24,086 INFO L225 Difference]: With dead ends: 8549 [2025-03-16 15:06:24,086 INFO L226 Difference]: Without dead ends: 4453 [2025-03-16 15:06:24,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:06:24,090 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 167 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:24,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 209 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:06:24,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4453 states. [2025-03-16 15:06:24,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4453 to 4453. [2025-03-16 15:06:24,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4453 states, 4452 states have (on average 1.0332434860736748) internal successors, (4600), 4452 states have internal predecessors, (4600), 0 states have call successors, (0), 0 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-16 15:06:24,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4453 states to 4453 states and 4600 transitions. [2025-03-16 15:06:24,144 INFO L78 Accepts]: Start accepts. Automaton has 4453 states and 4600 transitions. Word has length 1054 [2025-03-16 15:06:24,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:24,145 INFO L471 AbstractCegarLoop]: Abstraction has 4453 states and 4600 transitions. [2025-03-16 15:06:24,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 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-16 15:06:24,145 INFO L276 IsEmpty]: Start isEmpty. Operand 4453 states and 4600 transitions. [2025-03-16 15:06:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1108 [2025-03-16 15:06:24,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:24,161 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:24,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:06:24,161 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:24,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:24,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1596770555, now seen corresponding path program 1 times [2025-03-16 15:06:24,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:24,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827837373] [2025-03-16 15:06:24,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:24,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:24,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1107 statements into 1 equivalence classes. [2025-03-16 15:06:24,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1107 of 1107 statements. [2025-03-16 15:06:24,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:24,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:25,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3659 backedges. 2613 proven. 72 refuted. 0 times theorem prover too weak. 974 trivial. 0 not checked. [2025-03-16 15:06:25,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:25,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827837373] [2025-03-16 15:06:25,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827837373] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:25,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628274718] [2025-03-16 15:06:25,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:25,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:25,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:25,156 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-16 15:06:25,158 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-16 15:06:25,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1107 statements into 1 equivalence classes. [2025-03-16 15:06:25,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1107 of 1107 statements. [2025-03-16 15:06:25,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:25,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:25,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 1347 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 15:06:25,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:26,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3659 backedges. 2522 proven. 716 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2025-03-16 15:06:26,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:06:26,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3659 backedges. 2685 proven. 0 refuted. 0 times theorem prover too weak. 974 trivial. 0 not checked. [2025-03-16 15:06:26,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628274718] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:26,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:06:26,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2025-03-16 15:06:26,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638501482] [2025-03-16 15:06:26,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:26,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:06:26,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:26,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:06:26,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:06:26,475 INFO L87 Difference]: Start difference. First operand 4453 states and 4600 transitions. Second operand has 5 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 0 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-16 15:06:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:26,836 INFO L93 Difference]: Finished difference Result 9261 states and 9580 transitions. [2025-03-16 15:06:26,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:06:26,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 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 1107 [2025-03-16 15:06:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:26,842 INFO L225 Difference]: With dead ends: 9261 [2025-03-16 15:06:26,842 INFO L226 Difference]: Without dead ends: 4987 [2025-03-16 15:06:26,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2217 GetRequests, 2209 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:06:26,847 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 45 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:26,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 8 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:06:26,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2025-03-16 15:06:26,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4453. [2025-03-16 15:06:26,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4453 states, 4452 states have (on average 1.0332434860736748) internal successors, (4600), 4452 states have internal predecessors, (4600), 0 states have call successors, (0), 0 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-16 15:06:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4453 states to 4453 states and 4600 transitions. [2025-03-16 15:06:26,914 INFO L78 Accepts]: Start accepts. Automaton has 4453 states and 4600 transitions. Word has length 1107 [2025-03-16 15:06:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:26,914 INFO L471 AbstractCegarLoop]: Abstraction has 4453 states and 4600 transitions. [2025-03-16 15:06:26,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 0 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-16 15:06:26,915 INFO L276 IsEmpty]: Start isEmpty. Operand 4453 states and 4600 transitions. [2025-03-16 15:06:26,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1352 [2025-03-16 15:06:26,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:26,925 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:26,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 15:06:27,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:27,129 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:27,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:27,130 INFO L85 PathProgramCache]: Analyzing trace with hash 762134144, now seen corresponding path program 1 times [2025-03-16 15:06:27,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:27,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478866573] [2025-03-16 15:06:27,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:27,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:27,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1351 statements into 1 equivalence classes. [2025-03-16 15:06:27,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1351 of 1351 statements. [2025-03-16 15:06:27,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:27,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5674 backedges. 4289 proven. 72 refuted. 0 times theorem prover too weak. 1313 trivial. 0 not checked. [2025-03-16 15:06:28,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:28,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478866573] [2025-03-16 15:06:28,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478866573] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:28,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315647664] [2025-03-16 15:06:28,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:28,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:28,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:28,442 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-16 15:06:28,444 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-16 15:06:28,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1351 statements into 1 equivalence classes. [2025-03-16 15:06:28,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1351 of 1351 statements. [2025-03-16 15:06:28,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:28,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:28,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 1633 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 15:06:28,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5674 backedges. 4248 proven. 666 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-16 15:06:29,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:06:29,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5674 backedges. 4361 proven. 0 refuted. 0 times theorem prover too weak. 1313 trivial. 0 not checked. [2025-03-16 15:06:29,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315647664] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:29,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:06:29,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2025-03-16 15:06:29,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626583175] [2025-03-16 15:06:29,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:29,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:06:29,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:29,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:06:29,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:06:29,532 INFO L87 Difference]: Start difference. First operand 4453 states and 4600 transitions. Second operand has 5 states, 5 states have (on average 145.6) internal successors, (728), 5 states have internal predecessors, (728), 0 states have call successors, (0), 0 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-16 15:06:29,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:29,841 INFO L93 Difference]: Finished difference Result 9261 states and 9573 transitions. [2025-03-16 15:06:29,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:06:29,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 145.6) internal successors, (728), 5 states have internal predecessors, (728), 0 states have call successors, (0), 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 1351 [2025-03-16 15:06:29,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:29,847 INFO L225 Difference]: With dead ends: 9261 [2025-03-16 15:06:29,847 INFO L226 Difference]: Without dead ends: 4987 [2025-03-16 15:06:29,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2705 GetRequests, 2698 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:06:29,853 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 95 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:29,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 8 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:06:29,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2025-03-16 15:06:29,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4453. [2025-03-16 15:06:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4453 states, 4452 states have (on average 1.032794249775382) internal successors, (4598), 4452 states have internal predecessors, (4598), 0 states have call successors, (0), 0 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-16 15:06:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4453 states to 4453 states and 4598 transitions. [2025-03-16 15:06:29,893 INFO L78 Accepts]: Start accepts. Automaton has 4453 states and 4598 transitions. Word has length 1351 [2025-03-16 15:06:29,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:29,893 INFO L471 AbstractCegarLoop]: Abstraction has 4453 states and 4598 transitions. [2025-03-16 15:06:29,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 145.6) internal successors, (728), 5 states have internal predecessors, (728), 0 states have call successors, (0), 0 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-16 15:06:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 4453 states and 4598 transitions. [2025-03-16 15:06:29,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1639 [2025-03-16 15:06:29,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:29,907 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:29,915 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-16 15:06:30,107 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,SelfDestructingSolverStorable21 [2025-03-16 15:06:30,108 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:30,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:30,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1233893139, now seen corresponding path program 1 times [2025-03-16 15:06:30,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:30,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423923471] [2025-03-16 15:06:30,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:30,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:30,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1638 statements into 1 equivalence classes. [2025-03-16 15:06:30,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1638 of 1638 statements. [2025-03-16 15:06:30,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:30,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:31,892 INFO L134 CoverageAnalysis]: Checked inductivity of 8254 backedges. 6528 proven. 304 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2025-03-16 15:06:31,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:31,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423923471] [2025-03-16 15:06:31,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423923471] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:31,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104511011] [2025-03-16 15:06:31,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:31,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:31,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:31,894 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-16 15:06:31,895 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-16 15:06:31,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1638 statements into 1 equivalence classes. [2025-03-16 15:06:32,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1638 of 1638 statements. [2025-03-16 15:06:32,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:32,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:32,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 1963 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 15:06:32,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8254 backedges. 5989 proven. 716 refuted. 0 times theorem prover too weak. 1549 trivial. 0 not checked. [2025-03-16 15:06:32,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:06:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 8254 backedges. 6152 proven. 0 refuted. 0 times theorem prover too weak. 2102 trivial. 0 not checked. [2025-03-16 15:06:33,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104511011] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:33,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:06:33,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 10 [2025-03-16 15:06:33,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660384784] [2025-03-16 15:06:33,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:33,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:06:33,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:33,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:06:33,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:06:33,065 INFO L87 Difference]: Start difference. First operand 4453 states and 4598 transitions. Second operand has 5 states, 5 states have (on average 157.0) internal successors, (785), 5 states have internal predecessors, (785), 0 states have call successors, (0), 0 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-16 15:06:33,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:33,467 INFO L93 Difference]: Finished difference Result 9439 states and 9742 transitions. [2025-03-16 15:06:33,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:06:33,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 157.0) internal successors, (785), 5 states have internal predecessors, (785), 0 states have call successors, (0), 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 1638 [2025-03-16 15:06:33,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:33,474 INFO L225 Difference]: With dead ends: 9439 [2025-03-16 15:06:33,475 INFO L226 Difference]: Without dead ends: 5165 [2025-03-16 15:06:33,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3280 GetRequests, 3272 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:06:33,478 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 45 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:33,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 8 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:33,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2025-03-16 15:06:33,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 4631. [2025-03-16 15:06:33,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4631 states, 4630 states have (on average 1.0317494600431965) internal successors, (4777), 4630 states have internal predecessors, (4777), 0 states have call successors, (0), 0 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-16 15:06:33,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4631 states to 4631 states and 4777 transitions. [2025-03-16 15:06:33,513 INFO L78 Accepts]: Start accepts. Automaton has 4631 states and 4777 transitions. Word has length 1638 [2025-03-16 15:06:33,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:33,514 INFO L471 AbstractCegarLoop]: Abstraction has 4631 states and 4777 transitions. [2025-03-16 15:06:33,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 157.0) internal successors, (785), 5 states have internal predecessors, (785), 0 states have call successors, (0), 0 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-16 15:06:33,514 INFO L276 IsEmpty]: Start isEmpty. Operand 4631 states and 4777 transitions. [2025-03-16 15:06:33,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1889 [2025-03-16 15:06:33,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:33,555 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:33,564 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-16 15:06:33,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:33,756 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:33,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:33,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2097700644, now seen corresponding path program 1 times [2025-03-16 15:06:33,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:33,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148491080] [2025-03-16 15:06:33,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:33,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:33,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1888 statements into 1 equivalence classes. [2025-03-16 15:06:33,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1888 of 1888 statements. [2025-03-16 15:06:33,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:33,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:34,857 INFO L134 CoverageAnalysis]: Checked inductivity of 11220 backedges. 449 proven. 0 refuted. 0 times theorem prover too weak. 10771 trivial. 0 not checked. [2025-03-16 15:06:34,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:34,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148491080] [2025-03-16 15:06:34,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148491080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:34,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:34,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:34,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179805247] [2025-03-16 15:06:34,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:34,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:34,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:34,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:34,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:34,859 INFO L87 Difference]: Start difference. First operand 4631 states and 4777 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 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-16 15:06:35,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:35,212 INFO L93 Difference]: Finished difference Result 9615 states and 9913 transitions. [2025-03-16 15:06:35,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:35,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 1888 [2025-03-16 15:06:35,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:35,213 INFO L225 Difference]: With dead ends: 9615 [2025-03-16 15:06:35,213 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:06:35,218 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-16 15:06:35,218 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 162 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:35,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 189 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:06:35,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:06:35,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:06:35,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:06:35,219 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1888 [2025-03-16 15:06:35,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:35,219 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:06:35,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 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-16 15:06:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:06:35,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:06:35,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:06:35,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 15:06:35,224 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:35,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:06:35,780 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:06:35,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:06:35 BoogieIcfgContainer [2025-03-16 15:06:35,797 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:06:35,797 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:06:35,797 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:06:35,798 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:06:35,798 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:06:03" (3/4) ... [2025-03-16 15:06:35,800 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:06:35,813 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 15:06:35,814 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:06:35,815 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:06:35,815 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:06:35,914 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:06:35,915 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:06:35,915 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:06:35,916 INFO L158 Benchmark]: Toolchain (without parser) took 33890.25ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 103.1MB in the beginning and 140.0MB in the end (delta: -36.9MB). Peak memory consumption was 369.5MB. Max. memory is 16.1GB. [2025-03-16 15:06:35,916 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:06:35,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.27ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 70.2MB in the end (delta: 32.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-16 15:06:35,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.61ms. Allocated memory is still 142.6MB. Free memory was 70.2MB in the beginning and 60.8MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 15:06:35,918 INFO L158 Benchmark]: Boogie Preprocessor took 91.63ms. Allocated memory is still 142.6MB. Free memory was 60.8MB in the beginning and 49.7MB in the end (delta: 11.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 15:06:35,918 INFO L158 Benchmark]: IcfgBuilder took 1095.37ms. Allocated memory is still 142.6MB. Free memory was 49.7MB in the beginning and 66.5MB in the end (delta: -16.8MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2025-03-16 15:06:35,918 INFO L158 Benchmark]: TraceAbstraction took 32134.84ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 66.5MB in the beginning and 153.5MB in the end (delta: -86.9MB). Peak memory consumption was 311.5MB. Max. memory is 16.1GB. [2025-03-16 15:06:35,918 INFO L158 Benchmark]: Witness Printer took 117.44ms. Allocated memory is still 545.3MB. Free memory was 153.5MB in the beginning and 140.0MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 15:06:35,919 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.27ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 70.2MB in the end (delta: 32.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.61ms. Allocated memory is still 142.6MB. Free memory was 70.2MB in the beginning and 60.8MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.63ms. Allocated memory is still 142.6MB. Free memory was 60.8MB in the beginning and 49.7MB in the end (delta: 11.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 1095.37ms. Allocated memory is still 142.6MB. Free memory was 49.7MB in the beginning and 66.5MB in the end (delta: -16.8MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. * TraceAbstraction took 32134.84ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 66.5MB in the beginning and 153.5MB in the end (delta: -86.9MB). Peak memory consumption was 311.5MB. Max. memory is 16.1GB. * Witness Printer took 117.44ms. Allocated memory is still 545.3MB. Free memory was 153.5MB in the beginning and 140.0MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 110]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 184 locations, 360 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.5s, OverallIterations: 24, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3374 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3374 mSDsluCounter, 2599 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 1392 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12563 IncrementalHoareTripleChecker+Invalid, 13955 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1392 mSolverCounterUnsat, 2480 mSDtfsCounter, 12563 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11043 GetRequests, 10984 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4631occurred in iteration=23, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 5702 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 21643 NumberOfCodeBlocks, 21643 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 26404 ConstructedInterpolants, 0 QuantifiedInterpolants, 60585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 7539 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 34 InterpolantComputations, 23 PerfectInterpolantSequences, 89146/92457 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 890]: Location Invariant Derived location invariant: ((((((((((((((long long) a12 + 43) <= 0) && ((((7 <= a15) && (a24 == 1)) && (a15 <= 8)) || (((a24 == 1) && (a15 <= 8)) && (a21 != 10)))) || ((((a12 <= 11) && (a21 == 8)) && (a24 == 1)) && (a15 <= 8))) || ((((a12 <= 11) && (a24 == 1)) && (a15 <= 8)) && (a21 == 9))) || (((a21 == 8) && (((long long) a12 + 43) <= 0)) && (a24 == 1))) || ((((a12 <= 11) && (a24 == 1)) && (10 <= a21)) && (a15 == 8))) || ((((((long long) a12 + 43) <= 0) && (a24 == 1)) && (9 <= a15)) && (10 <= a21))) || (((a21 != 10) && (((long long) 49 + a12) <= 0)) && (a15 <= 5))) || ((((((7 <= a15) && (a24 == 1)) && (a15 <= 8)) || ((a24 == 1) && (a21 != 10))) && (a12 <= 600006)) && (0 <= ((long long) 41 + a12)))) || ((a24 == 1) && (a15 <= 5))) || (((a12 <= 11) && (a24 == 1)) && (0 <= ((long long) 41 + a12)))) || ((((a24 == 1) && (9 <= a15)) && (a12 <= 600006)) && (0 <= ((long long) 41 + a12)))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:06:35,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE