./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label05.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 9eb211dff2d7d24fbef4856e0a2f1ba2134136f04d84e12518dc8b67ba1dd611 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:54:35,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:54:35,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:54:35,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:54:35,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:54:35,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:54:35,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:54:35,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:54:35,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:54:35,892 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:54:35,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:54:35,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:54:35,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:54:35,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:54:35,893 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:54:35,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:54:35,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:54:35,894 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:54:35,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:54:35,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:54:35,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:54:35,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:54:35,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:54:35,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:54:35,894 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:54:35,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:54:35,894 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:54:35,895 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:54:35,895 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:54:35,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:54:35,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:54:35,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:54:35,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:54:35,895 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:54:35,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:54:35,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:54:35,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:54:35,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:54:35,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:54:35,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:54:35,896 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:54:35,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:54:35,896 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:54:35,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:54:35,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:54:35,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:54:35,897 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:54:35,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:54:35,897 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 -> 9eb211dff2d7d24fbef4856e0a2f1ba2134136f04d84e12518dc8b67ba1dd611 [2025-01-08 22:54:36,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:54:36,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:54:36,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:54:36,129 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:54:36,129 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:54:36,130 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label05.c [2025-01-08 22:54:37,303 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/03b428c2e/75ef531780a24b85ae7eaed959b33e0f/FLAG71d860de1 [2025-01-08 22:54:37,742 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:54:37,744 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label05.c [2025-01-08 22:54:37,759 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/03b428c2e/75ef531780a24b85ae7eaed959b33e0f/FLAG71d860de1 [2025-01-08 22:54:37,775 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/03b428c2e/75ef531780a24b85ae7eaed959b33e0f [2025-01-08 22:54:37,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:54:37,778 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:54:37,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:54:37,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:54:37,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:54:37,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:54:37" (1/1) ... [2025-01-08 22:54:37,784 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7beeddcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:37, skipping insertion in model container [2025-01-08 22:54:37,784 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:54:37" (1/1) ... [2025-01-08 22:54:37,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:54:38,080 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/Problem03_label05.c[55544,55557] [2025-01-08 22:54:38,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:54:38,113 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:54:38,228 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/Problem03_label05.c[55544,55557] [2025-01-08 22:54:38,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:54:38,259 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:54:38,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:38 WrapperNode [2025-01-08 22:54:38,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:54:38,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:54:38,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:54:38,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:54:38,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:38" (1/1) ... [2025-01-08 22:54:38,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:38" (1/1) ... [2025-01-08 22:54:38,378 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-01-08 22:54:38,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:54:38,379 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:54:38,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:54:38,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:54:38,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:38" (1/1) ... [2025-01-08 22:54:38,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:38" (1/1) ... [2025-01-08 22:54:38,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:38" (1/1) ... [2025-01-08 22:54:38,433 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 22:54:38,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:38" (1/1) ... [2025-01-08 22:54:38,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:38" (1/1) ... [2025-01-08 22:54:38,465 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:38" (1/1) ... [2025-01-08 22:54:38,470 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:38" (1/1) ... [2025-01-08 22:54:38,476 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:38" (1/1) ... [2025-01-08 22:54:38,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:38" (1/1) ... [2025-01-08 22:54:38,488 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:38" (1/1) ... [2025-01-08 22:54:38,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:54:38,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:54:38,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:54:38,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:54:38,512 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:38" (1/1) ... [2025-01-08 22:54:38,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:54:38,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:54:38,539 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:54:38,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:54:38,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:54:38,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:54:38,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:54:38,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:54:38,627 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:54:38,629 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:54:40,095 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-01-08 22:54:40,095 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:54:40,118 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:54:40,118 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:54:40,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:54:40 BoogieIcfgContainer [2025-01-08 22:54:40,118 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:54:40,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:54:40,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:54:40,128 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:54:40,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:54:37" (1/3) ... [2025-01-08 22:54:40,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14cf3fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:54:40, skipping insertion in model container [2025-01-08 22:54:40,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:38" (2/3) ... [2025-01-08 22:54:40,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14cf3fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:54:40, skipping insertion in model container [2025-01-08 22:54:40,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:54:40" (3/3) ... [2025-01-08 22:54:40,132 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label05.c [2025-01-08 22:54:40,152 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:54:40,156 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label05.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:54:40,214 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:54:40,228 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;@711ab7d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:54:40,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:54:40,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-08 22:54:40,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:40,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:40,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:40,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:40,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1434516826, now seen corresponding path program 1 times [2025-01-08 22:54:40,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:40,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040563680] [2025-01-08 22:54:40,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:40,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:40,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-08 22:54:40,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-08 22:54:40,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:40,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:54:41,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:41,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040563680] [2025-01-08 22:54:41,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040563680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:41,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:41,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:54:41,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323987879] [2025-01-08 22:54:41,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:41,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:41,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:41,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:41,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:41,194 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:42,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:42,257 INFO L93 Difference]: Finished difference Result 857 states and 1495 transitions. [2025-01-08 22:54:42,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:42,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2025-01-08 22:54:42,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:42,271 INFO L225 Difference]: With dead ends: 857 [2025-01-08 22:54:42,271 INFO L226 Difference]: Without dead ends: 462 [2025-01-08 22:54:42,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:42,279 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 130 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:42,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 186 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 22:54:42,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-01-08 22:54:42,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2025-01-08 22:54:42,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 1.5381263616557734) internal successors, (706), 459 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:42,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 706 transitions. [2025-01-08 22:54:42,341 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 706 transitions. Word has length 158 [2025-01-08 22:54:42,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:42,345 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 706 transitions. [2025-01-08 22:54:42,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:42,345 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 706 transitions. [2025-01-08 22:54:42,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-08 22:54:42,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:42,351 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:42,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:54:42,351 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:42,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:42,352 INFO L85 PathProgramCache]: Analyzing trace with hash -244572103, now seen corresponding path program 1 times [2025-01-08 22:54:42,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:42,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356485508] [2025-01-08 22:54:42,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:42,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:42,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-08 22:54:42,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-08 22:54:42,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:42,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:42,518 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:54:42,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:42,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356485508] [2025-01-08 22:54:42,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356485508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:42,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:42,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:54:42,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63006156] [2025-01-08 22:54:42,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:42,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:42,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:42,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:42,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:42,521 INFO L87 Difference]: Start difference. First operand 460 states and 706 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:43,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:43,344 INFO L93 Difference]: Finished difference Result 1344 states and 2079 transitions. [2025-01-08 22:54:43,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:43,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-01-08 22:54:43,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:43,355 INFO L225 Difference]: With dead ends: 1344 [2025-01-08 22:54:43,355 INFO L226 Difference]: Without dead ends: 886 [2025-01-08 22:54:43,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:43,357 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:43,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 94 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:54:43,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-01-08 22:54:43,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 870. [2025-01-08 22:54:43,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 1.5120828538550057) internal successors, (1314), 869 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1314 transitions. [2025-01-08 22:54:43,387 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1314 transitions. Word has length 166 [2025-01-08 22:54:43,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:43,387 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1314 transitions. [2025-01-08 22:54:43,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:43,387 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1314 transitions. [2025-01-08 22:54:43,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-08 22:54:43,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:43,394 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:43,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:54:43,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:43,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:43,395 INFO L85 PathProgramCache]: Analyzing trace with hash 320337504, now seen corresponding path program 1 times [2025-01-08 22:54:43,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:43,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102045770] [2025-01-08 22:54:43,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:43,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:43,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-08 22:54:43,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-08 22:54:43,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:43,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:43,633 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-08 22:54:43,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:43,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102045770] [2025-01-08 22:54:43,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102045770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:43,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:43,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:43,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556883353] [2025-01-08 22:54:43,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:43,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:43,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:43,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:43,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:43,638 INFO L87 Difference]: Start difference. First operand 870 states and 1314 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:43,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:43,913 INFO L93 Difference]: Finished difference Result 2583 states and 3908 transitions. [2025-01-08 22:54:43,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:43,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 178 [2025-01-08 22:54:43,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:43,919 INFO L225 Difference]: With dead ends: 2583 [2025-01-08 22:54:43,920 INFO L226 Difference]: Without dead ends: 1715 [2025-01-08 22:54:43,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:43,923 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 361 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:43,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 586 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:54:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2025-01-08 22:54:43,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1711. [2025-01-08 22:54:43,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1710 states have (on average 1.5140350877192983) internal successors, (2589), 1710 states have internal predecessors, (2589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2589 transitions. [2025-01-08 22:54:43,964 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2589 transitions. Word has length 178 [2025-01-08 22:54:43,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:43,964 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 2589 transitions. [2025-01-08 22:54:43,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:43,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2589 transitions. [2025-01-08 22:54:43,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-08 22:54:43,968 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:43,968 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:43,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:54:43,969 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:43,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:43,970 INFO L85 PathProgramCache]: Analyzing trace with hash -538096421, now seen corresponding path program 1 times [2025-01-08 22:54:43,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:43,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095063864] [2025-01-08 22:54:43,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:43,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:44,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-08 22:54:44,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-08 22:54:44,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:44,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:44,208 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:54:44,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:44,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095063864] [2025-01-08 22:54:44,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095063864] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:44,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:44,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:44,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392973599] [2025-01-08 22:54:44,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:44,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:44,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:44,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:44,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:44,210 INFO L87 Difference]: Start difference. First operand 1711 states and 2589 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 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-01-08 22:54:44,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:44,840 INFO L93 Difference]: Finished difference Result 3418 states and 5174 transitions. [2025-01-08 22:54:44,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:44,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 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 180 [2025-01-08 22:54:44,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:44,846 INFO L225 Difference]: With dead ends: 3418 [2025-01-08 22:54:44,846 INFO L226 Difference]: Without dead ends: 1709 [2025-01-08 22:54:44,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:44,848 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 271 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:44,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 385 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:54:44,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2025-01-08 22:54:44,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1706. [2025-01-08 22:54:44,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1705 states have (on average 1.4105571847507332) internal successors, (2405), 1705 states have internal predecessors, (2405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:44,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2405 transitions. [2025-01-08 22:54:44,878 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2405 transitions. Word has length 180 [2025-01-08 22:54:44,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:44,878 INFO L471 AbstractCegarLoop]: Abstraction has 1706 states and 2405 transitions. [2025-01-08 22:54:44,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 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-01-08 22:54:44,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2405 transitions. [2025-01-08 22:54:44,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-08 22:54:44,880 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:44,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:54:44,881 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:44,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:44,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1480150696, now seen corresponding path program 1 times [2025-01-08 22:54:44,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:44,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734499352] [2025-01-08 22:54:44,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:44,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:44,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-08 22:54:44,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-08 22:54:44,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:44,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:54:45,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:45,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734499352] [2025-01-08 22:54:45,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734499352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:45,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:45,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:54:45,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004487666] [2025-01-08 22:54:45,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:45,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:45,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:45,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:45,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:45,103 INFO L87 Difference]: Start difference. First operand 1706 states and 2405 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:45,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:45,758 INFO L93 Difference]: Finished difference Result 5034 states and 7104 transitions. [2025-01-08 22:54:45,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:45,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 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 181 [2025-01-08 22:54:45,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:45,767 INFO L225 Difference]: With dead ends: 5034 [2025-01-08 22:54:45,767 INFO L226 Difference]: Without dead ends: 3330 [2025-01-08 22:54:45,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:45,770 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 197 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:45,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 199 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:54:45,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3330 states. [2025-01-08 22:54:45,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3330 to 3330. [2025-01-08 22:54:45,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3330 states, 3329 states have (on average 1.2565334935416042) internal successors, (4183), 3329 states have internal predecessors, (4183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:45,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 4183 transitions. [2025-01-08 22:54:45,816 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 4183 transitions. Word has length 181 [2025-01-08 22:54:45,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:45,816 INFO L471 AbstractCegarLoop]: Abstraction has 3330 states and 4183 transitions. [2025-01-08 22:54:45,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:45,817 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 4183 transitions. [2025-01-08 22:54:45,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-08 22:54:45,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:45,821 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2025-01-08 22:54:45,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:54:45,821 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:45,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:45,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1458700189, now seen corresponding path program 1 times [2025-01-08 22:54:45,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:45,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769059300] [2025-01-08 22:54:45,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:45,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:45,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-08 22:54:45,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-08 22:54:45,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:45,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:46,075 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:54:46,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:46,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769059300] [2025-01-08 22:54:46,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769059300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:46,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:46,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:46,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385570733] [2025-01-08 22:54:46,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:46,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:46,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:46,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:46,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:46,077 INFO L87 Difference]: Start difference. First operand 3330 states and 4183 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:47,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:47,206 INFO L93 Difference]: Finished difference Result 9922 states and 12465 transitions. [2025-01-08 22:54:47,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:47,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 193 [2025-01-08 22:54:47,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:47,224 INFO L225 Difference]: With dead ends: 9922 [2025-01-08 22:54:47,224 INFO L226 Difference]: Without dead ends: 6594 [2025-01-08 22:54:47,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:47,228 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 202 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:47,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 368 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-08 22:54:47,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6594 states. [2025-01-08 22:54:47,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6594 to 6588. [2025-01-08 22:54:47,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6588 states, 6587 states have (on average 1.1987247608926674) internal successors, (7896), 6587 states have internal predecessors, (7896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:47,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6588 states to 6588 states and 7896 transitions. [2025-01-08 22:54:47,341 INFO L78 Accepts]: Start accepts. Automaton has 6588 states and 7896 transitions. Word has length 193 [2025-01-08 22:54:47,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:47,342 INFO L471 AbstractCegarLoop]: Abstraction has 6588 states and 7896 transitions. [2025-01-08 22:54:47,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:47,342 INFO L276 IsEmpty]: Start isEmpty. Operand 6588 states and 7896 transitions. [2025-01-08 22:54:47,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-08 22:54:47,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:47,350 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:47,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:54:47,350 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:47,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:47,350 INFO L85 PathProgramCache]: Analyzing trace with hash -91753372, now seen corresponding path program 1 times [2025-01-08 22:54:47,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:47,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134413494] [2025-01-08 22:54:47,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:47,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:47,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-08 22:54:47,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-08 22:54:47,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:47,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-08 22:54:47,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:47,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134413494] [2025-01-08 22:54:47,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134413494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:47,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:47,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:54:47,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354106190] [2025-01-08 22:54:47,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:47,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:47,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:47,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:47,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:47,588 INFO L87 Difference]: Start difference. First operand 6588 states and 7896 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:48,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:48,308 INFO L93 Difference]: Finished difference Result 16274 states and 19507 transitions. [2025-01-08 22:54:48,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:48,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 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 206 [2025-01-08 22:54:48,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:48,331 INFO L225 Difference]: With dead ends: 16274 [2025-01-08 22:54:48,331 INFO L226 Difference]: Without dead ends: 9688 [2025-01-08 22:54:48,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:48,339 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 219 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:48,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 162 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:54:48,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9688 states. [2025-01-08 22:54:48,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9688 to 9685. [2025-01-08 22:54:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9685 states, 9684 states have (on average 1.1966129698471706) internal successors, (11588), 9684 states have internal predecessors, (11588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:48,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9685 states to 9685 states and 11588 transitions. [2025-01-08 22:54:48,506 INFO L78 Accepts]: Start accepts. Automaton has 9685 states and 11588 transitions. Word has length 206 [2025-01-08 22:54:48,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:48,506 INFO L471 AbstractCegarLoop]: Abstraction has 9685 states and 11588 transitions. [2025-01-08 22:54:48,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:48,507 INFO L276 IsEmpty]: Start isEmpty. Operand 9685 states and 11588 transitions. [2025-01-08 22:54:48,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-08 22:54:48,516 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:48,516 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 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] [2025-01-08 22:54:48,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:54:48,516 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:48,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:48,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1696536905, now seen corresponding path program 1 times [2025-01-08 22:54:48,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:48,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422444807] [2025-01-08 22:54:48,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:48,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:48,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-08 22:54:48,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-08 22:54:48,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:48,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-08 22:54:48,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:48,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422444807] [2025-01-08 22:54:48,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422444807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:48,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:48,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:54:48,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085524962] [2025-01-08 22:54:48,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:48,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:48,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:48,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:48,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:48,640 INFO L87 Difference]: Start difference. First operand 9685 states and 11588 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-01-08 22:54:49,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:49,106 INFO L93 Difference]: Finished difference Result 18887 states and 22641 transitions. [2025-01-08 22:54:49,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:49,107 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 212 [2025-01-08 22:54:49,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:49,131 INFO L225 Difference]: With dead ends: 18887 [2025-01-08 22:54:49,131 INFO L226 Difference]: Without dead ends: 9204 [2025-01-08 22:54:49,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:49,140 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 326 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:49,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:54:49,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9204 states. [2025-01-08 22:54:49,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9204 to 9204. [2025-01-08 22:54:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9204 states, 9203 states have (on average 1.1801586439204608) internal successors, (10861), 9203 states have internal predecessors, (10861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9204 states to 9204 states and 10861 transitions. [2025-01-08 22:54:49,280 INFO L78 Accepts]: Start accepts. Automaton has 9204 states and 10861 transitions. Word has length 212 [2025-01-08 22:54:49,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:49,280 INFO L471 AbstractCegarLoop]: Abstraction has 9204 states and 10861 transitions. [2025-01-08 22:54:49,280 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-01-08 22:54:49,283 INFO L276 IsEmpty]: Start isEmpty. Operand 9204 states and 10861 transitions. [2025-01-08 22:54:49,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-01-08 22:54:49,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:49,293 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:49,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:54:49,294 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:49,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:49,294 INFO L85 PathProgramCache]: Analyzing trace with hash 605390997, now seen corresponding path program 1 times [2025-01-08 22:54:49,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:49,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880823455] [2025-01-08 22:54:49,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:49,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:49,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-08 22:54:49,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-08 22:54:49,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:49,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:49,415 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:54:49,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:49,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880823455] [2025-01-08 22:54:49,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880823455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:49,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:49,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:49,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227595612] [2025-01-08 22:54:49,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:49,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:49,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:49,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:49,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:49,417 INFO L87 Difference]: Start difference. First operand 9204 states and 10861 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:49,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:49,685 INFO L93 Difference]: Finished difference Result 26589 states and 31525 transitions. [2025-01-08 22:54:49,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:49,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 218 [2025-01-08 22:54:49,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:49,714 INFO L225 Difference]: With dead ends: 26589 [2025-01-08 22:54:49,714 INFO L226 Difference]: Without dead ends: 17387 [2025-01-08 22:54:49,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:49,726 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 289 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:49,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 525 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:54:49,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17387 states. [2025-01-08 22:54:49,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17387 to 17385. [2025-01-08 22:54:49,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17385 states, 17384 states have (on average 1.1879314312011044) internal successors, (20651), 17384 states have internal predecessors, (20651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17385 states to 17385 states and 20651 transitions. [2025-01-08 22:54:49,910 INFO L78 Accepts]: Start accepts. Automaton has 17385 states and 20651 transitions. Word has length 218 [2025-01-08 22:54:49,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:49,910 INFO L471 AbstractCegarLoop]: Abstraction has 17385 states and 20651 transitions. [2025-01-08 22:54:49,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:49,910 INFO L276 IsEmpty]: Start isEmpty. Operand 17385 states and 20651 transitions. [2025-01-08 22:54:49,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-08 22:54:49,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:49,923 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:49,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:54:49,923 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:49,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:49,924 INFO L85 PathProgramCache]: Analyzing trace with hash -765393953, now seen corresponding path program 1 times [2025-01-08 22:54:49,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:49,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020157796] [2025-01-08 22:54:49,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:49,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:49,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-08 22:54:49,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-08 22:54:49,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:49,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:50,200 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 73 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 22:54:50,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:50,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020157796] [2025-01-08 22:54:50,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020157796] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:54:50,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637994781] [2025-01-08 22:54:50,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:50,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:54:50,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:54:50,208 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:54:50,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 22:54:50,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-08 22:54:50,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-08 22:54:50,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:50,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:50,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:54:50,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:54:50,411 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-08 22:54:50,414 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:54:50,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637994781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:50,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:54:50,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-01-08 22:54:50,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528758558] [2025-01-08 22:54:50,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:50,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:50,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:50,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:50,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:54:50,418 INFO L87 Difference]: Start difference. First operand 17385 states and 20651 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:51,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:51,128 INFO L93 Difference]: Finished difference Result 50039 states and 59745 transitions. [2025-01-08 22:54:51,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:51,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2025-01-08 22:54:51,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:51,177 INFO L225 Difference]: With dead ends: 50039 [2025-01-08 22:54:51,177 INFO L226 Difference]: Without dead ends: 32656 [2025-01-08 22:54:51,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 224 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-01-08 22:54:51,196 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 219 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:51,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 135 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:54:51,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32656 states. [2025-01-08 22:54:51,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32656 to 32646. [2025-01-08 22:54:51,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32646 states, 32645 states have (on average 1.1766273548782356) internal successors, (38411), 32645 states have internal predecessors, (38411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:51,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32646 states to 32646 states and 38411 transitions. [2025-01-08 22:54:51,621 INFO L78 Accepts]: Start accepts. Automaton has 32646 states and 38411 transitions. Word has length 225 [2025-01-08 22:54:51,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:51,621 INFO L471 AbstractCegarLoop]: Abstraction has 32646 states and 38411 transitions. [2025-01-08 22:54:51,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:51,621 INFO L276 IsEmpty]: Start isEmpty. Operand 32646 states and 38411 transitions. [2025-01-08 22:54:51,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-08 22:54:51,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:51,646 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:51,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 22:54:51,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-08 22:54:51,847 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:51,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:51,848 INFO L85 PathProgramCache]: Analyzing trace with hash -726748154, now seen corresponding path program 1 times [2025-01-08 22:54:51,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:51,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604429152] [2025-01-08 22:54:51,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:51,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:51,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-08 22:54:51,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-08 22:54:51,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:51,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:54:52,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:52,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604429152] [2025-01-08 22:54:52,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604429152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:52,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:52,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:52,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472711013] [2025-01-08 22:54:52,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:52,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:52,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:52,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:52,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:52,085 INFO L87 Difference]: Start difference. First operand 32646 states and 38411 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:53,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:53,087 INFO L93 Difference]: Finished difference Result 80328 states and 95697 transitions. [2025-01-08 22:54:53,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:53,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2025-01-08 22:54:53,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:53,149 INFO L225 Difference]: With dead ends: 80328 [2025-01-08 22:54:53,149 INFO L226 Difference]: Without dead ends: 47684 [2025-01-08 22:54:53,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:53,163 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 157 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:53,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 366 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:54:53,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47684 states. [2025-01-08 22:54:53,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47684 to 47668. [2025-01-08 22:54:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47668 states, 47667 states have (on average 1.1317683093125224) internal successors, (53948), 47667 states have internal predecessors, (53948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47668 states to 47668 states and 53948 transitions. [2025-01-08 22:54:53,793 INFO L78 Accepts]: Start accepts. Automaton has 47668 states and 53948 transitions. Word has length 234 [2025-01-08 22:54:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:53,793 INFO L471 AbstractCegarLoop]: Abstraction has 47668 states and 53948 transitions. [2025-01-08 22:54:53,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 47668 states and 53948 transitions. [2025-01-08 22:54:53,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-01-08 22:54:53,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:53,818 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 22:54:53,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 22:54:53,819 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:53,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:53,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2016112043, now seen corresponding path program 1 times [2025-01-08 22:54:53,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:53,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070747128] [2025-01-08 22:54:53,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:53,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:53,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-08 22:54:53,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-08 22:54:53,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:53,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-08 22:54:54,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:54,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070747128] [2025-01-08 22:54:54,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070747128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:54,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:54,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:54:54,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823792906] [2025-01-08 22:54:54,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:54,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:54,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:54,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:54,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:54,080 INFO L87 Difference]: Start difference. First operand 47668 states and 53948 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 2 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:54,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:54,891 INFO L93 Difference]: Finished difference Result 115892 states and 131609 transitions. [2025-01-08 22:54:54,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:54,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 2 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 294 [2025-01-08 22:54:54,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:54,980 INFO L225 Difference]: With dead ends: 115892 [2025-01-08 22:54:54,980 INFO L226 Difference]: Without dead ends: 68226 [2025-01-08 22:54:55,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:55,015 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 154 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:55,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 198 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:54:55,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68226 states. [2025-01-08 22:54:55,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68226 to 56198. [2025-01-08 22:54:55,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56198 states, 56197 states have (on average 1.1393846646618147) internal successors, (64030), 56197 states have internal predecessors, (64030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:55,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56198 states to 56198 states and 64030 transitions. [2025-01-08 22:54:55,830 INFO L78 Accepts]: Start accepts. Automaton has 56198 states and 64030 transitions. Word has length 294 [2025-01-08 22:54:55,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:55,830 INFO L471 AbstractCegarLoop]: Abstraction has 56198 states and 64030 transitions. [2025-01-08 22:54:55,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 2 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:55,830 INFO L276 IsEmpty]: Start isEmpty. Operand 56198 states and 64030 transitions. [2025-01-08 22:54:55,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-01-08 22:54:55,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:55,849 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:55,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 22:54:55,849 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:55,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:55,850 INFO L85 PathProgramCache]: Analyzing trace with hash -225339990, now seen corresponding path program 1 times [2025-01-08 22:54:55,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:55,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914483894] [2025-01-08 22:54:55,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:55,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:56,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-08 22:54:56,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-08 22:54:56,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:56,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:54:56,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:56,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914483894] [2025-01-08 22:54:56,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914483894] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:56,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:56,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:56,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58770137] [2025-01-08 22:54:56,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:56,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:54:56,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:56,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:54:56,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:54:56,231 INFO L87 Difference]: Start difference. First operand 56198 states and 64030 transitions. Second operand has 4 states, 4 states have (on average 73.5) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:57,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:57,046 INFO L93 Difference]: Finished difference Result 113216 states and 128962 transitions. [2025-01-08 22:54:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:54:57,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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 299 [2025-01-08 22:54:57,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:57,104 INFO L225 Difference]: With dead ends: 113216 [2025-01-08 22:54:57,104 INFO L226 Difference]: Without dead ends: 57020 [2025-01-08 22:54:57,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:54:57,138 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 623 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:57,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 44 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:54:57,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57020 states. [2025-01-08 22:54:57,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57020 to 55778. [2025-01-08 22:54:57,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55778 states, 55777 states have (on average 1.1270595406708859) internal successors, (62864), 55777 states have internal predecessors, (62864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55778 states to 55778 states and 62864 transitions. [2025-01-08 22:54:57,986 INFO L78 Accepts]: Start accepts. Automaton has 55778 states and 62864 transitions. Word has length 299 [2025-01-08 22:54:57,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:57,986 INFO L471 AbstractCegarLoop]: Abstraction has 55778 states and 62864 transitions. [2025-01-08 22:54:57,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:57,986 INFO L276 IsEmpty]: Start isEmpty. Operand 55778 states and 62864 transitions. [2025-01-08 22:54:58,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-01-08 22:54:58,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:58,009 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:58,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 22:54:58,010 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:58,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:58,010 INFO L85 PathProgramCache]: Analyzing trace with hash -924714583, now seen corresponding path program 1 times [2025-01-08 22:54:58,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:58,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718336462] [2025-01-08 22:54:58,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:58,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:58,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-01-08 22:54:58,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-01-08 22:54:58,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:58,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:58,439 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-08 22:54:58,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:58,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718336462] [2025-01-08 22:54:58,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718336462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:58,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:58,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:58,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472808890] [2025-01-08 22:54:58,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:58,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:58,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:58,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:58,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:58,441 INFO L87 Difference]: Start difference. First operand 55778 states and 62864 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:59,222 INFO L93 Difference]: Finished difference Result 127833 states and 144095 transitions. [2025-01-08 22:54:59,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:59,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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 301 [2025-01-08 22:54:59,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:59,357 INFO L225 Difference]: With dead ends: 127833 [2025-01-08 22:54:59,357 INFO L226 Difference]: Without dead ends: 64749 [2025-01-08 22:54:59,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:59,394 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 165 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:59,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 362 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:54:59,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64749 states. [2025-01-08 22:54:59,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64749 to 56793. [2025-01-08 22:55:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56793 states, 56792 states have (on average 1.0797119312579238) internal successors, (61319), 56792 states have internal predecessors, (61319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:00,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56793 states to 56793 states and 61319 transitions. [2025-01-08 22:55:00,159 INFO L78 Accepts]: Start accepts. Automaton has 56793 states and 61319 transitions. Word has length 301 [2025-01-08 22:55:00,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:00,159 INFO L471 AbstractCegarLoop]: Abstraction has 56793 states and 61319 transitions. [2025-01-08 22:55:00,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:00,159 INFO L276 IsEmpty]: Start isEmpty. Operand 56793 states and 61319 transitions. [2025-01-08 22:55:00,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-01-08 22:55:00,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:00,173 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:00,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 22:55:00,173 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:00,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:00,174 INFO L85 PathProgramCache]: Analyzing trace with hash 157826603, now seen corresponding path program 1 times [2025-01-08 22:55:00,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:00,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930624130] [2025-01-08 22:55:00,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:00,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:00,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-01-08 22:55:00,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-01-08 22:55:00,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:00,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:55:00,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:00,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930624130] [2025-01-08 22:55:00,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930624130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:00,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:00,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:00,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716251283] [2025-01-08 22:55:00,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:00,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:00,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:00,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:00,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:00,378 INFO L87 Difference]: Start difference. First operand 56793 states and 61319 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:01,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:01,083 INFO L93 Difference]: Finished difference Result 112980 states and 122008 transitions. [2025-01-08 22:55:01,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:01,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 305 [2025-01-08 22:55:01,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:01,138 INFO L225 Difference]: With dead ends: 112980 [2025-01-08 22:55:01,138 INFO L226 Difference]: Without dead ends: 56189 [2025-01-08 22:55:01,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:01,173 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 107 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:01,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 275 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:55:01,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56189 states. [2025-01-08 22:55:01,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56189 to 55978. [2025-01-08 22:55:01,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55978 states, 55977 states have (on average 1.0755488861496687) internal successors, (60206), 55977 states have internal predecessors, (60206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:01,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55978 states to 55978 states and 60206 transitions. [2025-01-08 22:55:01,930 INFO L78 Accepts]: Start accepts. Automaton has 55978 states and 60206 transitions. Word has length 305 [2025-01-08 22:55:01,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:01,930 INFO L471 AbstractCegarLoop]: Abstraction has 55978 states and 60206 transitions. [2025-01-08 22:55:01,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 55978 states and 60206 transitions. [2025-01-08 22:55:01,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-01-08 22:55:01,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:01,942 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:01,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 22:55:01,943 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:01,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:01,943 INFO L85 PathProgramCache]: Analyzing trace with hash 391076206, now seen corresponding path program 1 times [2025-01-08 22:55:01,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:01,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805580323] [2025-01-08 22:55:01,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:01,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:01,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-01-08 22:55:01,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-01-08 22:55:01,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:01,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:02,282 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-01-08 22:55:02,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:02,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805580323] [2025-01-08 22:55:02,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805580323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:02,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:02,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:02,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440312982] [2025-01-08 22:55:02,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:02,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:55:02,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:02,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:55:02,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:02,284 INFO L87 Difference]: Start difference. First operand 55978 states and 60206 transitions. Second operand has 4 states, 4 states have (on average 61.0) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:03,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:03,167 INFO L93 Difference]: Finished difference Result 111591 states and 120054 transitions. [2025-01-08 22:55:03,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:55:03,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 317 [2025-01-08 22:55:03,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:03,218 INFO L225 Difference]: With dead ends: 111591 [2025-01-08 22:55:03,218 INFO L226 Difference]: Without dead ends: 54803 [2025-01-08 22:55:03,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:03,251 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 370 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:03,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 84 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:55:03,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54803 states. [2025-01-08 22:55:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54803 to 53136. [2025-01-08 22:55:03,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53136 states, 53135 states have (on average 1.0751293874094288) internal successors, (57127), 53135 states have internal predecessors, (57127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:03,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53136 states to 53136 states and 57127 transitions. [2025-01-08 22:55:03,829 INFO L78 Accepts]: Start accepts. Automaton has 53136 states and 57127 transitions. Word has length 317 [2025-01-08 22:55:03,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:03,829 INFO L471 AbstractCegarLoop]: Abstraction has 53136 states and 57127 transitions. [2025-01-08 22:55:03,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:03,829 INFO L276 IsEmpty]: Start isEmpty. Operand 53136 states and 57127 transitions. [2025-01-08 22:55:03,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-01-08 22:55:03,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:03,842 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:03,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 22:55:03,842 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:03,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:03,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1555001431, now seen corresponding path program 1 times [2025-01-08 22:55:03,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:03,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994864601] [2025-01-08 22:55:03,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:03,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:03,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-01-08 22:55:03,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-01-08 22:55:03,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:03,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-08 22:55:04,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:04,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994864601] [2025-01-08 22:55:04,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994864601] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:55:04,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795425505] [2025-01-08 22:55:04,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:04,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:55:04,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:55:04,390 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:55:04,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:55:04,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-01-08 22:55:04,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-01-08 22:55:04,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:04,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:04,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:55:04,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:55:04,787 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-08 22:55:04,788 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:55:04,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795425505] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:04,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:55:04,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:55:04,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17392674] [2025-01-08 22:55:04,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:04,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:55:04,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:04,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:55:04,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:55:04,789 INFO L87 Difference]: Start difference. First operand 53136 states and 57127 transitions. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:05,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:05,649 INFO L93 Difference]: Finished difference Result 131527 states and 141260 transitions. [2025-01-08 22:55:05,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:55:05,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 322 [2025-01-08 22:55:05,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:05,727 INFO L225 Difference]: With dead ends: 131527 [2025-01-08 22:55:05,727 INFO L226 Difference]: Without dead ends: 78393 [2025-01-08 22:55:05,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:55:05,768 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 462 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:05,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 436 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:55:05,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78393 states. [2025-01-08 22:55:06,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78393 to 51723. [2025-01-08 22:55:06,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51723 states, 51722 states have (on average 1.0723676578631918) internal successors, (55465), 51722 states have internal predecessors, (55465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:06,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51723 states to 51723 states and 55465 transitions. [2025-01-08 22:55:06,516 INFO L78 Accepts]: Start accepts. Automaton has 51723 states and 55465 transitions. Word has length 322 [2025-01-08 22:55:06,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:06,520 INFO L471 AbstractCegarLoop]: Abstraction has 51723 states and 55465 transitions. [2025-01-08 22:55:06,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:06,520 INFO L276 IsEmpty]: Start isEmpty. Operand 51723 states and 55465 transitions. [2025-01-08 22:55:06,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-01-08 22:55:06,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:06,629 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:06,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 22:55:06,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-08 22:55:06,833 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:06,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:06,834 INFO L85 PathProgramCache]: Analyzing trace with hash 520318244, now seen corresponding path program 1 times [2025-01-08 22:55:06,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:06,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199192956] [2025-01-08 22:55:06,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:06,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:06,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-01-08 22:55:06,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-01-08 22:55:06,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:06,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-01-08 22:55:07,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:07,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199192956] [2025-01-08 22:55:07,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199192956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:07,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:07,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:55:07,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729560981] [2025-01-08 22:55:07,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:07,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:07,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:07,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:07,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:07,122 INFO L87 Difference]: Start difference. First operand 51723 states and 55465 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:07,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:07,823 INFO L93 Difference]: Finished difference Result 119549 states and 128073 transitions. [2025-01-08 22:55:07,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:07,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 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 381 [2025-01-08 22:55:07,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:08,018 INFO L225 Difference]: With dead ends: 119549 [2025-01-08 22:55:08,018 INFO L226 Difference]: Without dead ends: 67828 [2025-01-08 22:55:08,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:08,035 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 112 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:08,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 74 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:55:08,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67828 states. [2025-01-08 22:55:08,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67828 to 63766. [2025-01-08 22:55:08,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63766 states, 63765 states have (on average 1.0735513212577432) internal successors, (68455), 63765 states have internal predecessors, (68455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:08,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63766 states to 63766 states and 68455 transitions. [2025-01-08 22:55:08,600 INFO L78 Accepts]: Start accepts. Automaton has 63766 states and 68455 transitions. Word has length 381 [2025-01-08 22:55:08,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:08,603 INFO L471 AbstractCegarLoop]: Abstraction has 63766 states and 68455 transitions. [2025-01-08 22:55:08,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 63766 states and 68455 transitions. [2025-01-08 22:55:08,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-01-08 22:55:08,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:08,621 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:08,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 22:55:08,621 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:08,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:08,622 INFO L85 PathProgramCache]: Analyzing trace with hash 49739609, now seen corresponding path program 1 times [2025-01-08 22:55:08,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:08,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353290324] [2025-01-08 22:55:08,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:08,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:08,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-01-08 22:55:08,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-01-08 22:55:08,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:08,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 329 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-01-08 22:55:08,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:08,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353290324] [2025-01-08 22:55:08,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353290324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:08,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:08,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:08,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349620590] [2025-01-08 22:55:08,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:08,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:55:08,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:08,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:55:08,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:08,853 INFO L87 Difference]: Start difference. First operand 63766 states and 68455 transitions. Second operand has 4 states, 4 states have (on average 77.25) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:09,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:09,859 INFO L93 Difference]: Finished difference Result 168829 states and 181441 transitions. [2025-01-08 22:55:09,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:55:09,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 77.25) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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 382 [2025-01-08 22:55:09,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:09,977 INFO L225 Difference]: With dead ends: 168829 [2025-01-08 22:55:09,977 INFO L226 Difference]: Without dead ends: 104659 [2025-01-08 22:55:10,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:10,029 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 396 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:10,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 401 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:55:10,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104659 states. [2025-01-08 22:55:11,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104659 to 98357. [2025-01-08 22:55:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98357 states, 98356 states have (on average 1.070488836471593) internal successors, (105289), 98356 states have internal predecessors, (105289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:11,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98357 states to 98357 states and 105289 transitions. [2025-01-08 22:55:11,358 INFO L78 Accepts]: Start accepts. Automaton has 98357 states and 105289 transitions. Word has length 382 [2025-01-08 22:55:11,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:11,359 INFO L471 AbstractCegarLoop]: Abstraction has 98357 states and 105289 transitions. [2025-01-08 22:55:11,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.25) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:11,359 INFO L276 IsEmpty]: Start isEmpty. Operand 98357 states and 105289 transitions. [2025-01-08 22:55:11,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2025-01-08 22:55:11,373 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:11,374 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:11,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-08 22:55:11,374 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:11,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:11,374 INFO L85 PathProgramCache]: Analyzing trace with hash 439318035, now seen corresponding path program 1 times [2025-01-08 22:55:11,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:11,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905204609] [2025-01-08 22:55:11,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:11,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:11,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 397 statements into 1 equivalence classes. [2025-01-08 22:55:11,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 397 of 397 statements. [2025-01-08 22:55:11,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:11,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-01-08 22:55:11,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:11,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905204609] [2025-01-08 22:55:11,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905204609] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:55:11,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539131892] [2025-01-08 22:55:11,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:11,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:55:11,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:55:11,659 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:55:11,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 22:55:11,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 397 statements into 1 equivalence classes. [2025-01-08 22:55:11,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 397 of 397 statements. [2025-01-08 22:55:11,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:11,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:11,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:55:11,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:55:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-01-08 22:55:11,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:55:11,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539131892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:11,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:55:11,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:55:11,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808682982] [2025-01-08 22:55:11,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:11,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:55:11,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:11,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:55:11,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:55:11,938 INFO L87 Difference]: Start difference. First operand 98357 states and 105289 transitions. Second operand has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:13,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:13,238 INFO L93 Difference]: Finished difference Result 267677 states and 286776 transitions. [2025-01-08 22:55:13,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:55:13,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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 397 [2025-01-08 22:55:13,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:13,436 INFO L225 Difference]: With dead ends: 267677 [2025-01-08 22:55:13,436 INFO L226 Difference]: Without dead ends: 169322 [2025-01-08 22:55:13,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:55:13,515 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 491 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:13,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 285 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:55:13,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169322 states. [2025-01-08 22:55:15,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169322 to 135179. [2025-01-08 22:55:15,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135179 states, 135178 states have (on average 1.0736362425838524) internal successors, (145132), 135178 states have internal predecessors, (145132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:15,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135179 states to 135179 states and 145132 transitions. [2025-01-08 22:55:15,543 INFO L78 Accepts]: Start accepts. Automaton has 135179 states and 145132 transitions. Word has length 397 [2025-01-08 22:55:15,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:15,543 INFO L471 AbstractCegarLoop]: Abstraction has 135179 states and 145132 transitions. [2025-01-08 22:55:15,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 135179 states and 145132 transitions. [2025-01-08 22:55:15,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-01-08 22:55:15,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:15,575 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:15,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 22:55:15,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:55:15,776 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:15,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:15,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1070418995, now seen corresponding path program 1 times [2025-01-08 22:55:15,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:15,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168797252] [2025-01-08 22:55:15,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:15,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:15,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-01-08 22:55:15,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-01-08 22:55:15,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:15,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-01-08 22:55:16,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:16,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168797252] [2025-01-08 22:55:16,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168797252] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:16,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:16,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:16,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028278004] [2025-01-08 22:55:16,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:16,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:55:16,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:16,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:55:16,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:16,222 INFO L87 Difference]: Start difference. First operand 135179 states and 145132 transitions. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:17,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:17,676 INFO L93 Difference]: Finished difference Result 286304 states and 307743 transitions. [2025-01-08 22:55:17,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:55:17,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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 412 [2025-01-08 22:55:17,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:17,850 INFO L225 Difference]: With dead ends: 286304 [2025-01-08 22:55:17,850 INFO L226 Difference]: Without dead ends: 149706 [2025-01-08 22:55:17,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:17,954 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 345 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:17,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 87 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:55:18,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149706 states. [2025-01-08 22:55:19,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149706 to 133159. [2025-01-08 22:55:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133159 states, 133158 states have (on average 1.0756094263957103) internal successors, (143226), 133158 states have internal predecessors, (143226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:19,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133159 states to 133159 states and 143226 transitions. [2025-01-08 22:55:19,796 INFO L78 Accepts]: Start accepts. Automaton has 133159 states and 143226 transitions. Word has length 412 [2025-01-08 22:55:19,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:19,797 INFO L471 AbstractCegarLoop]: Abstraction has 133159 states and 143226 transitions. [2025-01-08 22:55:19,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand 133159 states and 143226 transitions. [2025-01-08 22:55:19,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-01-08 22:55:19,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:19,812 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:19,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 22:55:19,812 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:19,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:19,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1887091754, now seen corresponding path program 1 times [2025-01-08 22:55:19,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:19,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265957014] [2025-01-08 22:55:19,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:19,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:19,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-08 22:55:19,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-08 22:55:19,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:19,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:21,523 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 318 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:55:21,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:21,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265957014] [2025-01-08 22:55:21,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265957014] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:55:21,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389395546] [2025-01-08 22:55:21,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:21,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:55:21,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:55:21,526 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:55:21,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 22:55:21,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-08 22:55:21,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-08 22:55:21,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:21,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:21,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:55:21,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:55:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:55:22,027 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:55:22,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389395546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:22,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:55:22,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 22:55:22,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323353899] [2025-01-08 22:55:22,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:22,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:22,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:22,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:22,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:55:22,029 INFO L87 Difference]: Start difference. First operand 133159 states and 143226 transitions. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)