./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label08.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem19_label08.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3deeb63379d54c05d0983698ddc1fa49b6cf4b0b9b3a770af64a435678802fb9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:14:22,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:14:22,197 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:14:22,201 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:14:22,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:14:22,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:14:22,222 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:14:22,222 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:14:22,222 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:14:22,223 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:14:22,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:14:22,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:14:22,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:14:22,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:14:22,223 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:14:22,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:14:22,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:14:22,223 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:14:22,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:14:22,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:14:22,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:14:22,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:14:22,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:14:22,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:14:22,223 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:14:22,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:14:22,224 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:14:22,224 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:14:22,224 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:14:22,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:14:22,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:14:22,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:14:22,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:14:22,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:14:22,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:14:22,224 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:14:22,224 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:14:22,224 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:14:22,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:14:22,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:14:22,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:14:22,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:14:22,224 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:14:22,224 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3deeb63379d54c05d0983698ddc1fa49b6cf4b0b9b3a770af64a435678802fb9 [2025-02-05 12:14:22,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:14:22,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:14:22,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:14:22,462 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:14:22,463 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:14:22,464 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label08.c [2025-02-05 12:14:23,655 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36a94e1e4/d16c5a61381047cbb840304f644119f2/FLAG159af4511 [2025-02-05 12:14:24,132 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:14:24,132 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label08.c [2025-02-05 12:14:24,170 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36a94e1e4/d16c5a61381047cbb840304f644119f2/FLAG159af4511 [2025-02-05 12:14:24,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36a94e1e4/d16c5a61381047cbb840304f644119f2 [2025-02-05 12:14:24,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:14:24,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:14:24,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:14:24,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:14:24,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:14:24,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:14:24" (1/1) ... [2025-02-05 12:14:24,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20894f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:14:24, skipping insertion in model container [2025-02-05 12:14:24,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:14:24" (1/1) ... [2025-02-05 12:14:24,298 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:14:24,512 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label08.c[5076,5089] [2025-02-05 12:14:25,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:14:25,240 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:14:25,256 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label08.c[5076,5089] [2025-02-05 12:14:25,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:14:25,727 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:14:25,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:14:25 WrapperNode [2025-02-05 12:14:25,728 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:14:25,729 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:14:25,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:14:25,730 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:14:25,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:14:25" (1/1) ... [2025-02-05 12:14:25,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:14:25" (1/1) ... [2025-02-05 12:14:26,337 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-02-05 12:14:26,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:14:26,338 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:14:26,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:14:26,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:14:26,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:14:25" (1/1) ... [2025-02-05 12:14:26,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:14:25" (1/1) ... [2025-02-05 12:14:26,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:14:25" (1/1) ... [2025-02-05 12:14:26,773 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-02-05 12:14:26,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:14:25" (1/1) ... [2025-02-05 12:14:26,773 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:14:25" (1/1) ... [2025-02-05 12:14:27,172 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:14:25" (1/1) ... [2025-02-05 12:14:27,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:14:25" (1/1) ... [2025-02-05 12:14:27,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:14:25" (1/1) ... [2025-02-05 12:14:27,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:14:25" (1/1) ... [2025-02-05 12:14:27,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:14:27,328 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:14:27,328 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:14:27,328 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:14:27,329 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:14:25" (1/1) ... [2025-02-05 12:14:27,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:14:27,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:14:27,355 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 12:14:27,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 12:14:27,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:14:27,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:14:27,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:14:27,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:14:27,437 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:14:27,438 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:14:33,259 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-02-05 12:14:33,259 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-02-05 12:14:33,259 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-02-05 12:14:33,259 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-02-05 12:14:33,260 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-02-05 12:14:33,523 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-02-05 12:14:33,523 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:14:33,563 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:14:33,564 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:14:33,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:14:33 BoogieIcfgContainer [2025-02-05 12:14:33,565 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:14:33,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:14:33,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:14:33,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:14:33,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:14:24" (1/3) ... [2025-02-05 12:14:33,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748a67ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:14:33, skipping insertion in model container [2025-02-05 12:14:33,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:14:25" (2/3) ... [2025-02-05 12:14:33,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748a67ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:14:33, skipping insertion in model container [2025-02-05 12:14:33,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:14:33" (3/3) ... [2025-02-05 12:14:33,573 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label08.c [2025-02-05 12:14:33,584 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:14:33,586 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label08.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:14:33,666 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:14:33,675 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;@65425f40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:14:33,676 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:14:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:33,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 12:14:33,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:14:33,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:14:33,690 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:14:33,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:14:33,694 INFO L85 PathProgramCache]: Analyzing trace with hash -245495790, now seen corresponding path program 1 times [2025-02-05 12:14:33,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:14:33,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506238484] [2025-02-05 12:14:33,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:14:33,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:14:33,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 12:14:33,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 12:14:33,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:14:33,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:14:33,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:14:33,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:14:33,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506238484] [2025-02-05 12:14:33,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506238484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:14:33,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:14:33,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:14:33,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957696902] [2025-02-05 12:14:33,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:14:33,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:14:33,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:14:33,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:14:33,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:14:33,965 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:38,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:14:38,865 INFO L93 Difference]: Finished difference Result 4919 states and 9310 transitions. [2025-02-05 12:14:38,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:14:38,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-02-05 12:14:38,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:14:38,885 INFO L225 Difference]: With dead ends: 4919 [2025-02-05 12:14:38,885 INFO L226 Difference]: Without dead ends: 3107 [2025-02-05 12:14:38,890 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-02-05 12:14:38,893 INFO L435 NwaCegarLoop]: 1277 mSDtfsCounter, 1516 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 4638 mSolverCounterSat, 1110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 5748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1110 IncrementalHoareTripleChecker+Valid, 4638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:14:38,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1458 Invalid, 5748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1110 Valid, 4638 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-02-05 12:14:38,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2025-02-05 12:14:38,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 3106. [2025-02-05 12:14:38,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3106 states, 3105 states have (on average 1.652818035426731) internal successors, (5132), 3105 states have internal predecessors, (5132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 5132 transitions. [2025-02-05 12:14:39,006 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 5132 transitions. Word has length 37 [2025-02-05 12:14:39,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:14:39,006 INFO L471 AbstractCegarLoop]: Abstraction has 3106 states and 5132 transitions. [2025-02-05 12:14:39,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:39,006 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 5132 transitions. [2025-02-05 12:14:39,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 12:14:39,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:14:39,008 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:14:39,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:14:39,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:14:39,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:14:39,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2024133167, now seen corresponding path program 1 times [2025-02-05 12:14:39,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:14:39,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404718426] [2025-02-05 12:14:39,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:14:39,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:14:39,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 12:14:39,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 12:14:39,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:14:39,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:14:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:14:39,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:14:39,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404718426] [2025-02-05 12:14:39,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404718426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:14:39,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:14:39,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:14:39,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563637005] [2025-02-05 12:14:39,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:14:39,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:14:39,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:14:39,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:14:39,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:14:39,188 INFO L87 Difference]: Start difference. First operand 3106 states and 5132 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:43,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:14:43,999 INFO L93 Difference]: Finished difference Result 9097 states and 15084 transitions. [2025-02-05 12:14:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:14:44,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-02-05 12:14:44,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:14:44,023 INFO L225 Difference]: With dead ends: 9097 [2025-02-05 12:14:44,023 INFO L226 Difference]: Without dead ends: 5993 [2025-02-05 12:14:44,032 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-02-05 12:14:44,032 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 2533 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 5120 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 5554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:14:44,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 990 Invalid, 5554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5120 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-02-05 12:14:44,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2025-02-05 12:14:44,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 5991. [2025-02-05 12:14:44,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5991 states, 5990 states have (on average 1.606176961602671) internal successors, (9621), 5990 states have internal predecessors, (9621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:44,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5991 states to 5991 states and 9621 transitions. [2025-02-05 12:14:44,178 INFO L78 Accepts]: Start accepts. Automaton has 5991 states and 9621 transitions. Word has length 106 [2025-02-05 12:14:44,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:14:44,179 INFO L471 AbstractCegarLoop]: Abstraction has 5991 states and 9621 transitions. [2025-02-05 12:14:44,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:44,179 INFO L276 IsEmpty]: Start isEmpty. Operand 5991 states and 9621 transitions. [2025-02-05 12:14:44,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 12:14:44,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:14:44,183 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:14:44,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:14:44,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:14:44,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:14:44,186 INFO L85 PathProgramCache]: Analyzing trace with hash -773512057, now seen corresponding path program 1 times [2025-02-05 12:14:44,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:14:44,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058814056] [2025-02-05 12:14:44,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:14:44,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:14:44,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 12:14:44,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 12:14:44,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:14:44,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:14:44,382 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:14:44,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:14:44,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058814056] [2025-02-05 12:14:44,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058814056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:14:44,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:14:44,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:14:44,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323079283] [2025-02-05 12:14:44,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:14:44,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:14:44,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:14:44,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:14:44,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:14:44,385 INFO L87 Difference]: Start difference. First operand 5991 states and 9621 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 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-02-05 12:14:48,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:14:48,688 INFO L93 Difference]: Finished difference Result 17559 states and 28308 transitions. [2025-02-05 12:14:48,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:14:48,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 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-02-05 12:14:48,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:14:48,720 INFO L225 Difference]: With dead ends: 17559 [2025-02-05 12:14:48,720 INFO L226 Difference]: Without dead ends: 11570 [2025-02-05 12:14:48,727 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-02-05 12:14:48,727 INFO L435 NwaCegarLoop]: 1564 mSDtfsCounter, 1445 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 4825 mSolverCounterSat, 1045 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 5870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1045 IncrementalHoareTripleChecker+Valid, 4825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:14:48,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1445 Valid, 1732 Invalid, 5870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1045 Valid, 4825 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-02-05 12:14:48,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11570 states. [2025-02-05 12:14:48,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11570 to 11517. [2025-02-05 12:14:48,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11517 states, 11516 states have (on average 1.4296630774574506) internal successors, (16464), 11516 states have internal predecessors, (16464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:48,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11517 states to 11517 states and 16464 transitions. [2025-02-05 12:14:48,876 INFO L78 Accepts]: Start accepts. Automaton has 11517 states and 16464 transitions. Word has length 111 [2025-02-05 12:14:48,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:14:48,877 INFO L471 AbstractCegarLoop]: Abstraction has 11517 states and 16464 transitions. [2025-02-05 12:14:48,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 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-02-05 12:14:48,878 INFO L276 IsEmpty]: Start isEmpty. Operand 11517 states and 16464 transitions. [2025-02-05 12:14:48,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 12:14:48,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:14:48,880 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:14:48,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:14:48,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:14:48,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:14:48,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2072234135, now seen corresponding path program 1 times [2025-02-05 12:14:48,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:14:48,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632519584] [2025-02-05 12:14:48,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:14:48,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:14:48,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 12:14:48,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 12:14:48,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:14:48,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:14:49,022 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:14:49,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:14:49,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632519584] [2025-02-05 12:14:49,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632519584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:14:49,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:14:49,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:14:49,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466808699] [2025-02-05 12:14:49,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:14:49,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:14:49,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:14:49,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:14:49,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:14:49,023 INFO L87 Difference]: Start difference. First operand 11517 states and 16464 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:53,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:14:53,823 INFO L93 Difference]: Finished difference Result 34168 states and 48911 transitions. [2025-02-05 12:14:53,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:14:53,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-02-05 12:14:53,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:14:53,863 INFO L225 Difference]: With dead ends: 34168 [2025-02-05 12:14:53,863 INFO L226 Difference]: Without dead ends: 22653 [2025-02-05 12:14:53,872 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-02-05 12:14:53,873 INFO L435 NwaCegarLoop]: 1804 mSDtfsCounter, 1748 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 4312 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 2076 SdHoareTripleChecker+Invalid, 5742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:14:53,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 2076 Invalid, 5742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4312 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-02-05 12:14:53,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22653 states. [2025-02-05 12:14:54,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22653 to 21271. [2025-02-05 12:14:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21271 states, 21270 states have (on average 1.2866478608368594) internal successors, (27367), 21270 states have internal predecessors, (27367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:54,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21271 states to 21271 states and 27367 transitions. [2025-02-05 12:14:54,156 INFO L78 Accepts]: Start accepts. Automaton has 21271 states and 27367 transitions. Word has length 134 [2025-02-05 12:14:54,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:14:54,157 INFO L471 AbstractCegarLoop]: Abstraction has 21271 states and 27367 transitions. [2025-02-05 12:14:54,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:54,157 INFO L276 IsEmpty]: Start isEmpty. Operand 21271 states and 27367 transitions. [2025-02-05 12:14:54,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 12:14:54,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:14:54,159 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:14:54,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:14:54,159 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:14:54,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:14:54,160 INFO L85 PathProgramCache]: Analyzing trace with hash -335878119, now seen corresponding path program 1 times [2025-02-05 12:14:54,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:14:54,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362886940] [2025-02-05 12:14:54,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:14:54,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:14:54,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 12:14:54,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 12:14:54,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:14:54,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:14:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:14:54,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:14:54,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362886940] [2025-02-05 12:14:54,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362886940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:14:54,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:14:54,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:14:54,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367034297] [2025-02-05 12:14:54,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:14:54,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:14:54,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:14:54,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:14:54,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:14:54,323 INFO L87 Difference]: Start difference. First operand 21271 states and 27367 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:59,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:14:59,134 INFO L93 Difference]: Finished difference Result 63157 states and 81268 transitions. [2025-02-05 12:14:59,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:14:59,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2025-02-05 12:14:59,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:14:59,191 INFO L225 Difference]: With dead ends: 63157 [2025-02-05 12:14:59,192 INFO L226 Difference]: Without dead ends: 41888 [2025-02-05 12:14:59,204 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-02-05 12:14:59,207 INFO L435 NwaCegarLoop]: 1668 mSDtfsCounter, 1467 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 4395 mSolverCounterSat, 1425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 5820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1425 IncrementalHoareTripleChecker+Valid, 4395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:14:59,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 1887 Invalid, 5820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1425 Valid, 4395 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-02-05 12:14:59,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41888 states. [2025-02-05 12:14:59,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41888 to 40473. [2025-02-05 12:14:59,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40473 states, 40472 states have (on average 1.1933188377149635) internal successors, (48296), 40472 states have internal predecessors, (48296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40473 states to 40473 states and 48296 transitions. [2025-02-05 12:14:59,617 INFO L78 Accepts]: Start accepts. Automaton has 40473 states and 48296 transitions. Word has length 175 [2025-02-05 12:14:59,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:14:59,618 INFO L471 AbstractCegarLoop]: Abstraction has 40473 states and 48296 transitions. [2025-02-05 12:14:59,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:59,619 INFO L276 IsEmpty]: Start isEmpty. Operand 40473 states and 48296 transitions. [2025-02-05 12:14:59,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-02-05 12:14:59,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:14:59,623 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:14:59,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:14:59,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:14:59,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:14:59,624 INFO L85 PathProgramCache]: Analyzing trace with hash -468218719, now seen corresponding path program 1 times [2025-02-05 12:14:59,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:14:59,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145395764] [2025-02-05 12:14:59,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:14:59,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:14:59,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-02-05 12:14:59,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-02-05 12:14:59,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:14:59,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:15:00,613 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 12:15:00,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:15:00,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145395764] [2025-02-05 12:15:00,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145395764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:15:00,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:15:00,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:15:00,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179219180] [2025-02-05 12:15:00,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:15:00,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:15:00,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:15:00,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:15:00,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:15:00,616 INFO L87 Difference]: Start difference. First operand 40473 states and 48296 transitions. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:15:07,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:15:07,275 INFO L93 Difference]: Finished difference Result 100135 states and 117552 transitions. [2025-02-05 12:15:07,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:15:07,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 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 404 [2025-02-05 12:15:07,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:15:07,353 INFO L225 Difference]: With dead ends: 100135 [2025-02-05 12:15:07,354 INFO L226 Difference]: Without dead ends: 59664 [2025-02-05 12:15:07,386 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-02-05 12:15:07,388 INFO L435 NwaCegarLoop]: 1802 mSDtfsCounter, 3756 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 9446 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3756 SdHoareTripleChecker+Valid, 2158 SdHoareTripleChecker+Invalid, 9690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 9446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:15:07,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3756 Valid, 2158 Invalid, 9690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 9446 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2025-02-05 12:15:07,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59664 states. [2025-02-05 12:15:07,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59664 to 56892. [2025-02-05 12:15:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56892 states, 56891 states have (on average 1.154470830184036) internal successors, (65679), 56891 states have internal predecessors, (65679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:15:07,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56892 states to 56892 states and 65679 transitions. [2025-02-05 12:15:07,951 INFO L78 Accepts]: Start accepts. Automaton has 56892 states and 65679 transitions. Word has length 404 [2025-02-05 12:15:07,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:15:07,951 INFO L471 AbstractCegarLoop]: Abstraction has 56892 states and 65679 transitions. [2025-02-05 12:15:07,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:15:07,952 INFO L276 IsEmpty]: Start isEmpty. Operand 56892 states and 65679 transitions. [2025-02-05 12:15:07,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-02-05 12:15:07,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:15:07,960 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:15:07,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:15:07,961 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:15:07,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:15:07,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1733025231, now seen corresponding path program 1 times [2025-02-05 12:15:07,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:15:07,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474370629] [2025-02-05 12:15:07,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:15:07,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:15:07,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-02-05 12:15:08,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-02-05 12:15:08,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:15:08,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:15:08,585 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 12:15:08,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:15:08,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474370629] [2025-02-05 12:15:08,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474370629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:15:08,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:15:08,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:15:08,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096019878] [2025-02-05 12:15:08,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:15:08,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:15:08,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:15:08,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:15:08,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:15:08,587 INFO L87 Difference]: Start difference. First operand 56892 states and 65679 transitions. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:15:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:15:13,712 INFO L93 Difference]: Finished difference Result 116543 states and 134135 transitions. [2025-02-05 12:15:13,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:15:13,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 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 432 [2025-02-05 12:15:13,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:15:13,774 INFO L225 Difference]: With dead ends: 116543 [2025-02-05 12:15:13,775 INFO L226 Difference]: Without dead ends: 59622 [2025-02-05 12:15:13,798 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-02-05 12:15:13,799 INFO L435 NwaCegarLoop]: 1772 mSDtfsCounter, 1138 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 7319 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2114 SdHoareTripleChecker+Invalid, 7327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:15:13,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2114 Invalid, 7327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7319 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-02-05 12:15:13,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59622 states. [2025-02-05 12:15:14,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59622 to 59622. [2025-02-05 12:15:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59622 states, 59621 states have (on average 1.1474815920564903) internal successors, (68414), 59621 states have internal predecessors, (68414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:15:14,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59622 states to 59622 states and 68414 transitions. [2025-02-05 12:15:14,448 INFO L78 Accepts]: Start accepts. Automaton has 59622 states and 68414 transitions. Word has length 432 [2025-02-05 12:15:14,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:15:14,449 INFO L471 AbstractCegarLoop]: Abstraction has 59622 states and 68414 transitions. [2025-02-05 12:15:14,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:15:14,450 INFO L276 IsEmpty]: Start isEmpty. Operand 59622 states and 68414 transitions. [2025-02-05 12:15:14,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-02-05 12:15:14,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:15:14,457 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:15:14,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 12:15:14,458 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:15:14,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:15:14,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1341165008, now seen corresponding path program 1 times [2025-02-05 12:15:14,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:15:14,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395022232] [2025-02-05 12:15:14,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:15:14,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:15:14,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-02-05 12:15:14,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-02-05 12:15:14,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:15:14,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:15:14,818 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:15:14,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:15:14,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395022232] [2025-02-05 12:15:14,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395022232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:15:14,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:15:14,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:15:14,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967310907] [2025-02-05 12:15:14,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:15:14,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:15:14,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:15:14,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:15:14,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:15:14,820 INFO L87 Difference]: Start difference. First operand 59622 states and 68414 transitions. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:15:19,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:15:19,962 INFO L93 Difference]: Finished difference Result 135757 states and 158848 transitions. [2025-02-05 12:15:19,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:15:19,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 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 598 [2025-02-05 12:15:19,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:15:20,039 INFO L225 Difference]: With dead ends: 135757 [2025-02-05 12:15:20,039 INFO L226 Difference]: Without dead ends: 78867 [2025-02-05 12:15:20,063 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-02-05 12:15:20,063 INFO L435 NwaCegarLoop]: 2831 mSDtfsCounter, 1453 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 4116 mSolverCounterSat, 1789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 3010 SdHoareTripleChecker+Invalid, 5905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1789 IncrementalHoareTripleChecker+Valid, 4116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:15:20,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1453 Valid, 3010 Invalid, 5905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1789 Valid, 4116 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-02-05 12:15:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78867 states. [2025-02-05 12:15:20,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78867 to 77397. [2025-02-05 12:15:20,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77397 states, 77396 states have (on average 1.14014936172412) internal successors, (88243), 77396 states have internal predecessors, (88243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:15:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77397 states to 77397 states and 88243 transitions. [2025-02-05 12:15:20,793 INFO L78 Accepts]: Start accepts. Automaton has 77397 states and 88243 transitions. Word has length 598 [2025-02-05 12:15:20,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:15:20,794 INFO L471 AbstractCegarLoop]: Abstraction has 77397 states and 88243 transitions. [2025-02-05 12:15:20,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:15:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 77397 states and 88243 transitions. [2025-02-05 12:15:20,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 744 [2025-02-05 12:15:20,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:15:20,798 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:15:20,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:15:20,799 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:15:20,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:15:20,799 INFO L85 PathProgramCache]: Analyzing trace with hash -566421321, now seen corresponding path program 1 times [2025-02-05 12:15:20,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:15:20,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109489081] [2025-02-05 12:15:20,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:15:20,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:15:20,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 743 statements into 1 equivalence classes. [2025-02-05 12:15:20,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 743 of 743 statements. [2025-02-05 12:15:20,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:15:20,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:15:21,789 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 69 proven. 37 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-02-05 12:15:21,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:15:21,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109489081] [2025-02-05 12:15:21,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109489081] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:15:21,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969631515] [2025-02-05 12:15:21,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:15:21,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:15:21,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:15:21,793 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:15:21,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 12:15:21,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 743 statements into 1 equivalence classes. [2025-02-05 12:15:22,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 743 of 743 statements. [2025-02-05 12:15:22,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:15:22,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:15:22,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 12:15:22,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:15:22,153 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-02-05 12:15:22,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:15:22,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969631515] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:15:22,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 12:15:22,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-05 12:15:22,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747920095] [2025-02-05 12:15:22,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:15:22,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:15:22,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:15:22,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:15:22,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:15:22,156 INFO L87 Difference]: Start difference. First operand 77397 states and 88243 transitions. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:15:26,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:15:26,795 INFO L93 Difference]: Finished difference Result 188946 states and 217821 transitions. [2025-02-05 12:15:26,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:15:26,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 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 743 [2025-02-05 12:15:26,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:15:27,052 INFO L225 Difference]: With dead ends: 188946 [2025-02-05 12:15:27,052 INFO L226 Difference]: Without dead ends: 114281 [2025-02-05 12:15:27,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 742 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:15:27,094 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 1542 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 5060 mSolverCounterSat, 1013 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 6073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1013 IncrementalHoareTripleChecker+Valid, 5060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:15:27,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 1651 Invalid, 6073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1013 Valid, 5060 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-02-05 12:15:27,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114281 states. [2025-02-05 12:15:27,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114281 to 107427. [2025-02-05 12:15:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107427 states, 107426 states have (on average 1.1416323794984455) internal successors, (122641), 107426 states have internal predecessors, (122641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:15:28,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107427 states to 107427 states and 122641 transitions. [2025-02-05 12:15:28,370 INFO L78 Accepts]: Start accepts. Automaton has 107427 states and 122641 transitions. Word has length 743 [2025-02-05 12:15:28,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:15:28,371 INFO L471 AbstractCegarLoop]: Abstraction has 107427 states and 122641 transitions. [2025-02-05 12:15:28,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:15:28,372 INFO L276 IsEmpty]: Start isEmpty. Operand 107427 states and 122641 transitions. [2025-02-05 12:15:28,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 855 [2025-02-05 12:15:28,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:15:28,386 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:15:28,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 12:15:28,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:15:28,587 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:15:28,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:15:28,588 INFO L85 PathProgramCache]: Analyzing trace with hash -987606561, now seen corresponding path program 1 times [2025-02-05 12:15:28,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:15:28,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245000298] [2025-02-05 12:15:28,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:15:28,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:15:28,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 854 statements into 1 equivalence classes. [2025-02-05 12:15:28,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 854 of 854 statements. [2025-02-05 12:15:28,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:15:28,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:15:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2025-02-05 12:15:29,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:15:29,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245000298] [2025-02-05 12:15:29,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245000298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:15:29,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:15:29,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:15:29,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033219235] [2025-02-05 12:15:29,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:15:29,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:15:29,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:15:29,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:15:29,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:15:29,049 INFO L87 Difference]: Start difference. First operand 107427 states and 122641 transitions. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 2 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:15:33,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:15:33,410 INFO L93 Difference]: Finished difference Result 239449 states and 273054 transitions. [2025-02-05 12:15:33,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:15:33,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 2 states have internal predecessors, (589), 0 states have call successors, (0), 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 854 [2025-02-05 12:15:33,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:15:33,575 INFO L225 Difference]: With dead ends: 239449 [2025-02-05 12:15:33,575 INFO L226 Difference]: Without dead ends: 134754 [2025-02-05 12:15:33,637 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-02-05 12:15:33,637 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 1385 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 3927 mSolverCounterSat, 1645 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 5572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1645 IncrementalHoareTripleChecker+Valid, 3927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:15:33,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 781 Invalid, 5572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1645 Valid, 3927 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-02-05 12:15:33,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134754 states. [2025-02-05 12:15:34,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134754 to 134729. [2025-02-05 12:15:35,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134729 states, 134728 states have (on average 1.1085668903271777) internal successors, (149355), 134728 states have internal predecessors, (149355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:15:35,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134729 states to 134729 states and 149355 transitions. [2025-02-05 12:15:35,192 INFO L78 Accepts]: Start accepts. Automaton has 134729 states and 149355 transitions. Word has length 854 [2025-02-05 12:15:35,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:15:35,193 INFO L471 AbstractCegarLoop]: Abstraction has 134729 states and 149355 transitions. [2025-02-05 12:15:35,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 2 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:15:35,194 INFO L276 IsEmpty]: Start isEmpty. Operand 134729 states and 149355 transitions. [2025-02-05 12:15:35,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 897 [2025-02-05 12:15:35,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:15:35,206 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:15:35,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 12:15:35,206 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:15:35,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:15:35,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1777477838, now seen corresponding path program 1 times [2025-02-05 12:15:35,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:15:35,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716714793] [2025-02-05 12:15:35,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:15:35,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:15:35,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 896 statements into 1 equivalence classes. [2025-02-05 12:15:35,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 896 of 896 statements. [2025-02-05 12:15:35,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:15:35,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:15:35,851 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-02-05 12:15:35,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:15:35,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716714793] [2025-02-05 12:15:35,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716714793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:15:35,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:15:35,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:15:35,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274556557] [2025-02-05 12:15:35,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:15:35,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:15:35,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:15:35,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:15:35,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:15:35,854 INFO L87 Difference]: Start difference. First operand 134729 states and 149355 transitions. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:15:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:15:41,510 INFO L93 Difference]: Finished difference Result 311884 states and 349248 transitions. [2025-02-05 12:15:41,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:15:41,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 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 896 [2025-02-05 12:15:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:15:41,704 INFO L225 Difference]: With dead ends: 311884 [2025-02-05 12:15:41,704 INFO L226 Difference]: Without dead ends: 179887 [2025-02-05 12:15:41,762 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-02-05 12:15:41,763 INFO L435 NwaCegarLoop]: 2976 mSDtfsCounter, 1320 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4930 mSolverCounterSat, 987 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 5917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 987 IncrementalHoareTripleChecker+Valid, 4930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:15:41,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 3147 Invalid, 5917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [987 Valid, 4930 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-02-05 12:15:41,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179887 states. [2025-02-05 12:15:43,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179887 to 177070. [2025-02-05 12:15:43,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177070 states, 177069 states have (on average 1.099096962201176) internal successors, (194616), 177069 states have internal predecessors, (194616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:15:43,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177070 states to 177070 states and 194616 transitions. [2025-02-05 12:15:43,529 INFO L78 Accepts]: Start accepts. Automaton has 177070 states and 194616 transitions. Word has length 896 [2025-02-05 12:15:43,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:15:43,530 INFO L471 AbstractCegarLoop]: Abstraction has 177070 states and 194616 transitions. [2025-02-05 12:15:43,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:15:43,530 INFO L276 IsEmpty]: Start isEmpty. Operand 177070 states and 194616 transitions. [2025-02-05 12:15:43,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 945 [2025-02-05 12:15:43,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:15:43,537 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:15:43,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 12:15:43,537 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:15:43,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:15:43,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1340443085, now seen corresponding path program 1 times [2025-02-05 12:15:43,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:15:43,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970832982] [2025-02-05 12:15:43,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:15:43,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:15:43,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 944 statements into 1 equivalence classes. [2025-02-05 12:15:43,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 944 of 944 statements. [2025-02-05 12:15:43,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:15:43,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:15:43,935 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 603 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-02-05 12:15:43,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:15:43,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970832982] [2025-02-05 12:15:43,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970832982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:15:43,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:15:43,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:15:43,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144714750] [2025-02-05 12:15:43,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:15:43,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:15:43,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:15:43,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:15:43,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:15:43,938 INFO L87 Difference]: Start difference. First operand 177070 states and 194616 transitions. Second operand has 4 states, 4 states have (on average 175.5) internal successors, (702), 4 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)