./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem19_label50.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 213e82f0c3aaf6f1d8296810defaeb904267dfe53482b301d593c63d0f165dcd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:19:25,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:19:25,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:19:25,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:19:25,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:19:25,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:19:25,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:19:25,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:19:25,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:19:25,129 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:19:25,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:19:25,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:19:25,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:19:25,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:19:25,130 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:19:25,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:19:25,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:19:25,131 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:19:25,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:19:25,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:19:25,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:19:25,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:19:25,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:19:25,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:19:25,131 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:19:25,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:19:25,132 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:19:25,132 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:19:25,132 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:19:25,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:19:25,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:19:25,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:19:25,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:19:25,133 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:19:25,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:19:25,133 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:19:25,133 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:19:25,133 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:19:25,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:19:25,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:19:25,134 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:19:25,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:19:25,134 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:19:25,134 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 -> 213e82f0c3aaf6f1d8296810defaeb904267dfe53482b301d593c63d0f165dcd [2025-02-05 12:19:25,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:19:25,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:19:25,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:19:25,437 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:19:25,437 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:19:25,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label50.c [2025-02-05 12:19:26,736 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ad2fc12d/1f6e05f425a04195bf12da1eac7e9258/FLAG62d5c77e7 [2025-02-05 12:19:27,284 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:19:27,285 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label50.c [2025-02-05 12:19:27,333 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ad2fc12d/1f6e05f425a04195bf12da1eac7e9258/FLAG62d5c77e7 [2025-02-05 12:19:27,801 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ad2fc12d/1f6e05f425a04195bf12da1eac7e9258 [2025-02-05 12:19:27,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:19:27,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:19:27,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:19:27,806 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:19:27,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:19:27,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:19:27" (1/1) ... [2025-02-05 12:19:27,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184cb39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:27, skipping insertion in model container [2025-02-05 12:19:27,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:19:27" (1/1) ... [2025-02-05 12:19:27,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:19:28,215 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label50.c[3006,3019] [2025-02-05 12:19:29,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:19:29,151 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:19:29,172 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label50.c[3006,3019] [2025-02-05 12:19:29,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:19:29,832 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:19:29,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:29 WrapperNode [2025-02-05 12:19:29,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:19:29,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:19:29,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:19:29,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:19:29,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:29" (1/1) ... [2025-02-05 12:19:29,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:29" (1/1) ... [2025-02-05 12:19:30,710 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-02-05 12:19:30,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:19:30,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:19:30,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:19:30,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:19:30,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:29" (1/1) ... [2025-02-05 12:19:30,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:29" (1/1) ... [2025-02-05 12:19:31,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:29" (1/1) ... [2025-02-05 12:19:31,309 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 12:19:31,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:29" (1/1) ... [2025-02-05 12:19:31,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:29" (1/1) ... [2025-02-05 12:19:31,515 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:29" (1/1) ... [2025-02-05 12:19:31,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:29" (1/1) ... [2025-02-05 12:19:31,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:29" (1/1) ... [2025-02-05 12:19:31,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:29" (1/1) ... [2025-02-05 12:19:31,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:19:31,689 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:19:31,689 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:19:31,689 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:19:31,690 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:29" (1/1) ... [2025-02-05 12:19:31,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:19:31,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:19:31,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 12:19:31,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 12:19:31,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:19:31,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:19:31,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:19:31,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:19:31,805 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:19:31,807 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:19:39,748 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-02-05 12:19:39,748 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-02-05 12:19:39,748 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-02-05 12:19:39,749 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-02-05 12:19:39,749 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-02-05 12:19:40,055 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-02-05 12:19:40,056 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:19:40,101 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:19:40,102 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:19:40,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:19:40 BoogieIcfgContainer [2025-02-05 12:19:40,102 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:19:40,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:19:40,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:19:40,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:19:40,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:19:27" (1/3) ... [2025-02-05 12:19:40,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba98a1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:19:40, skipping insertion in model container [2025-02-05 12:19:40,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:29" (2/3) ... [2025-02-05 12:19:40,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba98a1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:19:40, skipping insertion in model container [2025-02-05 12:19:40,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:19:40" (3/3) ... [2025-02-05 12:19:40,114 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label50.c [2025-02-05 12:19:40,129 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:19:40,131 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label50.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:19:40,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:19:40,241 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;@722b034a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:19:40,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:19:40,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:19:40,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 12:19:40,260 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:19:40,260 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] [2025-02-05 12:19:40,261 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:19:40,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:19:40,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1608638935, now seen corresponding path program 1 times [2025-02-05 12:19:40,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:19:40,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704993740] [2025-02-05 12:19:40,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:19:40,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:19:40,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 12:19:40,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 12:19:40,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:19:40,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:19:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:19:40,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:19:40,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704993740] [2025-02-05 12:19:40,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704993740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:19:40,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:19:40,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:19:40,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615583469] [2025-02-05 12:19:40,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:19:40,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:19:40,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:19:40,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:19:40,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:19:40,570 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:19:46,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:19:46,949 INFO L93 Difference]: Finished difference Result 4919 states and 9310 transitions. [2025-02-05 12:19:46,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:19:46,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-02-05 12:19:46,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:19:46,978 INFO L225 Difference]: With dead ends: 4919 [2025-02-05 12:19:46,978 INFO L226 Difference]: Without dead ends: 3107 [2025-02-05 12:19:46,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:19:46,988 INFO L435 NwaCegarLoop]: 1277 mSDtfsCounter, 1533 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 4638 mSolverCounterSat, 1110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 5748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1110 IncrementalHoareTripleChecker+Valid, 4638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:19:46,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1533 Valid, 1458 Invalid, 5748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1110 Valid, 4638 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-02-05 12:19:47,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2025-02-05 12:19:47,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 3106. [2025-02-05 12:19:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3106 states, 3105 states have (on average 1.652818035426731) internal successors, (5132), 3105 states have internal predecessors, (5132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:19:47,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 5132 transitions. [2025-02-05 12:19:47,144 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 5132 transitions. Word has length 20 [2025-02-05 12:19:47,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:19:47,145 INFO L471 AbstractCegarLoop]: Abstraction has 3106 states and 5132 transitions. [2025-02-05 12:19:47,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:19:47,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 5132 transitions. [2025-02-05 12:19:47,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 12:19:47,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:19:47,150 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 12:19:47,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:19:47,151 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:19:47,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:19:47,152 INFO L85 PathProgramCache]: Analyzing trace with hash -724360499, now seen corresponding path program 1 times [2025-02-05 12:19:47,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:19:47,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722055575] [2025-02-05 12:19:47,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:19:47,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:19:47,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 12:19:47,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 12:19:47,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:19:47,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:19:47,465 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:19:47,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:19:47,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722055575] [2025-02-05 12:19:47,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722055575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:19:47,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:19:47,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:19:47,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574567258] [2025-02-05 12:19:47,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:19:47,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:19:47,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:19:47,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:19:47,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:19:47,470 INFO L87 Difference]: Start difference. First operand 3106 states and 5132 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:19:53,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:19:53,635 INFO L93 Difference]: Finished difference Result 9097 states and 15084 transitions. [2025-02-05 12:19:53,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:19:53,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-02-05 12:19:53,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:19:53,663 INFO L225 Difference]: With dead ends: 9097 [2025-02-05 12:19:53,663 INFO L226 Difference]: Without dead ends: 5993 [2025-02-05 12:19:53,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:19:53,670 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 2533 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 5120 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 5554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:19:53,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 990 Invalid, 5554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5120 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-02-05 12:19:53,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2025-02-05 12:19:53,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 5991. [2025-02-05 12:19:53,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5991 states, 5990 states have (on average 1.606176961602671) internal successors, (9621), 5990 states have internal predecessors, (9621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:19:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5991 states to 5991 states and 9621 transitions. [2025-02-05 12:19:53,807 INFO L78 Accepts]: Start accepts. Automaton has 5991 states and 9621 transitions. Word has length 89 [2025-02-05 12:19:53,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:19:53,808 INFO L471 AbstractCegarLoop]: Abstraction has 5991 states and 9621 transitions. [2025-02-05 12:19:53,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:19:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 5991 states and 9621 transitions. [2025-02-05 12:19:53,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 12:19:53,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:19:53,811 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 12:19:53,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:19:53,812 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:19:53,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:19:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash -240891565, now seen corresponding path program 1 times [2025-02-05 12:19:53,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:19:53,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172214491] [2025-02-05 12:19:53,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:19:53,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:19:53,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 12:19:53,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 12:19:53,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:19:53,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:19:54,068 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:19:54,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:19:54,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172214491] [2025-02-05 12:19:54,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172214491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:19:54,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:19:54,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:19:54,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829733955] [2025-02-05 12:19:54,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:19:54,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:19:54,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:19:54,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:19:54,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:19:54,070 INFO L87 Difference]: Start difference. First operand 5991 states and 9621 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:19:59,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:19:59,281 INFO L93 Difference]: Finished difference Result 17559 states and 28308 transitions. [2025-02-05 12:19:59,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:19:59,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-02-05 12:19:59,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:19:59,313 INFO L225 Difference]: With dead ends: 17559 [2025-02-05 12:19:59,313 INFO L226 Difference]: Without dead ends: 11570 [2025-02-05 12:19:59,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:19:59,325 INFO L435 NwaCegarLoop]: 1564 mSDtfsCounter, 1446 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 4825 mSolverCounterSat, 1045 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1446 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 5870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1045 IncrementalHoareTripleChecker+Valid, 4825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:19:59,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1446 Valid, 1731 Invalid, 5870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1045 Valid, 4825 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-02-05 12:19:59,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11570 states. [2025-02-05 12:19:59,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11570 to 11517. [2025-02-05 12:19:59,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11517 states, 11516 states have (on average 1.4298367488711359) internal successors, (16466), 11516 states have internal predecessors, (16466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:19:59,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11517 states to 11517 states and 16466 transitions. [2025-02-05 12:19:59,531 INFO L78 Accepts]: Start accepts. Automaton has 11517 states and 16466 transitions. Word has length 94 [2025-02-05 12:19:59,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:19:59,533 INFO L471 AbstractCegarLoop]: Abstraction has 11517 states and 16466 transitions. [2025-02-05 12:19:59,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:19:59,533 INFO L276 IsEmpty]: Start isEmpty. Operand 11517 states and 16466 transitions. [2025-02-05 12:19:59,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 12:19:59,535 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:19:59,536 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:19:59,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:19:59,536 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:19:59,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:19:59,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1423412947, now seen corresponding path program 1 times [2025-02-05 12:19:59,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:19:59,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809759546] [2025-02-05 12:19:59,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:19:59,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:19:59,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 12:19:59,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 12:19:59,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:19:59,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:19:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:19:59,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:19:59,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809759546] [2025-02-05 12:19:59,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809759546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:19:59,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:19:59,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:19:59,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599582303] [2025-02-05 12:19:59,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:19:59,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:19:59,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:19:59,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:19:59,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:19:59,739 INFO L87 Difference]: Start difference. First operand 11517 states and 16466 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:05,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:20:05,138 INFO L93 Difference]: Finished difference Result 34168 states and 48917 transitions. [2025-02-05 12:20:05,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:20:05,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2025-02-05 12:20:05,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:20:05,196 INFO L225 Difference]: With dead ends: 34168 [2025-02-05 12:20:05,196 INFO L226 Difference]: Without dead ends: 22653 [2025-02-05 12:20:05,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:20:05,209 INFO L435 NwaCegarLoop]: 1804 mSDtfsCounter, 1748 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 4312 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 2076 SdHoareTripleChecker+Invalid, 5742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:20:05,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 2076 Invalid, 5742 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1430 Valid, 4312 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-02-05 12:20:05,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22653 states. [2025-02-05 12:20:05,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22653 to 22636. [2025-02-05 12:20:05,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22636 states, 22635 states have (on average 1.2716589352772256) internal successors, (28784), 22635 states have internal predecessors, (28784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:05,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22636 states to 22636 states and 28784 transitions. [2025-02-05 12:20:05,568 INFO L78 Accepts]: Start accepts. Automaton has 22636 states and 28784 transitions. Word has length 117 [2025-02-05 12:20:05,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:20:05,568 INFO L471 AbstractCegarLoop]: Abstraction has 22636 states and 28784 transitions. [2025-02-05 12:20:05,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:05,569 INFO L276 IsEmpty]: Start isEmpty. Operand 22636 states and 28784 transitions. [2025-02-05 12:20:05,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 12:20:05,570 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:20:05,571 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 12:20:05,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:20:05,571 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:20:05,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:20:05,571 INFO L85 PathProgramCache]: Analyzing trace with hash 835940225, now seen corresponding path program 1 times [2025-02-05 12:20:05,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:20:05,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735608767] [2025-02-05 12:20:05,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:20:05,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:20:05,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 12:20:05,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 12:20:05,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:20:05,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:20:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:20:05,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:20:05,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735608767] [2025-02-05 12:20:05,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735608767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:20:05,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:20:05,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:20:05,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633550923] [2025-02-05 12:20:05,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:20:05,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:20:05,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:20:05,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:20:05,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:20:05,784 INFO L87 Difference]: Start difference. First operand 22636 states and 28784 transitions. 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-02-05 12:20:11,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:20:11,292 INFO L93 Difference]: Finished difference Result 67252 states and 85519 transitions. [2025-02-05 12:20:11,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:20:11,293 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-02-05 12:20:11,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:20:11,374 INFO L225 Difference]: With dead ends: 67252 [2025-02-05 12:20:11,375 INFO L226 Difference]: Without dead ends: 44618 [2025-02-05 12:20:11,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:20:11,400 INFO L435 NwaCegarLoop]: 1668 mSDtfsCounter, 1467 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 4395 mSolverCounterSat, 1425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 5820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1425 IncrementalHoareTripleChecker+Valid, 4395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:20:11,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 1887 Invalid, 5820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1425 Valid, 4395 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-02-05 12:20:11,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44618 states. [2025-02-05 12:20:11,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44618 to 41838. [2025-02-05 12:20:11,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41838 states, 41837 states have (on average 1.1882544159476063) internal successors, (49713), 41837 states have internal predecessors, (49713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:11,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41838 states to 41838 states and 49713 transitions. [2025-02-05 12:20:11,929 INFO L78 Accepts]: Start accepts. Automaton has 41838 states and 49713 transitions. Word has length 158 [2025-02-05 12:20:11,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:20:11,930 INFO L471 AbstractCegarLoop]: Abstraction has 41838 states and 49713 transitions. [2025-02-05 12:20:11,930 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-02-05 12:20:11,930 INFO L276 IsEmpty]: Start isEmpty. Operand 41838 states and 49713 transitions. [2025-02-05 12:20:11,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-02-05 12:20:11,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:20:11,937 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:20:11,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:20:11,937 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:20:11,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:20:11,938 INFO L85 PathProgramCache]: Analyzing trace with hash -113854502, now seen corresponding path program 1 times [2025-02-05 12:20:11,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:20:11,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112502813] [2025-02-05 12:20:11,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:20:11,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:20:11,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-02-05 12:20:12,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-02-05 12:20:12,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:20:12,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:20:13,160 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 12:20:13,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:20:13,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112502813] [2025-02-05 12:20:13,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112502813] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:20:13,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:20:13,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:20:13,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833629531] [2025-02-05 12:20:13,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:20:13,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:20:13,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:20:13,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:20:13,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:20:13,166 INFO L87 Difference]: Start difference. First operand 41838 states and 49713 transitions. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:20,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:20:20,833 INFO L93 Difference]: Finished difference Result 102865 states and 120386 transitions. [2025-02-05 12:20:20,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:20:20,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 387 [2025-02-05 12:20:20,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:20:20,929 INFO L225 Difference]: With dead ends: 102865 [2025-02-05 12:20:20,929 INFO L226 Difference]: Without dead ends: 61029 [2025-02-05 12:20:20,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:20:20,960 INFO L435 NwaCegarLoop]: 1802 mSDtfsCounter, 3756 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 9446 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3756 SdHoareTripleChecker+Valid, 2158 SdHoareTripleChecker+Invalid, 9690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 9446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:20:20,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3756 Valid, 2158 Invalid, 9690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 9446 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2025-02-05 12:20:21,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61029 states. [2025-02-05 12:20:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61029 to 58257. [2025-02-05 12:20:21,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58257 states, 58256 states have (on average 1.151744026366383) internal successors, (67096), 58256 states have internal predecessors, (67096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:21,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58257 states to 58257 states and 67096 transitions. [2025-02-05 12:20:21,625 INFO L78 Accepts]: Start accepts. Automaton has 58257 states and 67096 transitions. Word has length 387 [2025-02-05 12:20:21,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:20:21,626 INFO L471 AbstractCegarLoop]: Abstraction has 58257 states and 67096 transitions. [2025-02-05 12:20:21,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:21,627 INFO L276 IsEmpty]: Start isEmpty. Operand 58257 states and 67096 transitions. [2025-02-05 12:20:21,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-02-05 12:20:21,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:20:21,634 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:20:21,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:20:21,634 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:20:21,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:20:21,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1603854700, now seen corresponding path program 1 times [2025-02-05 12:20:21,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:20:21,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183091481] [2025-02-05 12:20:21,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:20:21,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:20:21,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-02-05 12:20:21,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-02-05 12:20:21,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:20:21,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:20:22,508 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:20:22,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:20:22,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183091481] [2025-02-05 12:20:22,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183091481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:20:22,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:20:22,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:20:22,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723869452] [2025-02-05 12:20:22,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:20:22,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:20:22,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:20:22,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:20:22,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:20:22,511 INFO L87 Difference]: Start difference. First operand 58257 states and 67096 transitions. Second operand has 4 states, 4 states have (on average 103.75) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:27,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:20:27,523 INFO L93 Difference]: Finished difference Result 119273 states and 136969 transitions. [2025-02-05 12:20:27,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:20:27,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 415 [2025-02-05 12:20:27,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:20:27,589 INFO L225 Difference]: With dead ends: 119273 [2025-02-05 12:20:27,590 INFO L226 Difference]: Without dead ends: 60987 [2025-02-05 12:20:27,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:20:27,629 INFO L435 NwaCegarLoop]: 1772 mSDtfsCounter, 1151 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 5712 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1951 SdHoareTripleChecker+Invalid, 5720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:20:27,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1951 Invalid, 5720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 5712 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-02-05 12:20:27,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60987 states. [2025-02-05 12:20:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60987 to 60987. [2025-02-05 12:20:28,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60987 states, 60986 states have (on average 1.1450332863280097) internal successors, (69831), 60986 states have internal predecessors, (69831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:28,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60987 states to 60987 states and 69831 transitions. [2025-02-05 12:20:28,284 INFO L78 Accepts]: Start accepts. Automaton has 60987 states and 69831 transitions. Word has length 415 [2025-02-05 12:20:28,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:20:28,285 INFO L471 AbstractCegarLoop]: Abstraction has 60987 states and 69831 transitions. [2025-02-05 12:20:28,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:28,285 INFO L276 IsEmpty]: Start isEmpty. Operand 60987 states and 69831 transitions. [2025-02-05 12:20:28,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2025-02-05 12:20:28,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:20:28,297 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:20:28,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 12:20:28,297 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:20:28,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:20:28,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1326216341, now seen corresponding path program 1 times [2025-02-05 12:20:28,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:20:28,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413638] [2025-02-05 12:20:28,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:20:28,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:20:28,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 581 statements into 1 equivalence classes. [2025-02-05 12:20:28,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 581 of 581 statements. [2025-02-05 12:20:28,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:20:28,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:20:28,781 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:20:28,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:20:28,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413638] [2025-02-05 12:20:28,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:20:28,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:20:28,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:20:28,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528982] [2025-02-05 12:20:28,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:20:28,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:20:28,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:20:28,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:20:28,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:20:28,784 INFO L87 Difference]: Start difference. First operand 60987 states and 69831 transitions. Second operand has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:34,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:20:34,566 INFO L93 Difference]: Finished difference Result 138487 states and 161682 transitions. [2025-02-05 12:20:34,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:20:34,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 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 581 [2025-02-05 12:20:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:20:34,705 INFO L225 Difference]: With dead ends: 138487 [2025-02-05 12:20:34,705 INFO L226 Difference]: Without dead ends: 80232 [2025-02-05 12:20:34,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:20:34,734 INFO L435 NwaCegarLoop]: 2831 mSDtfsCounter, 1453 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 4116 mSolverCounterSat, 1789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 3010 SdHoareTripleChecker+Invalid, 5905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1789 IncrementalHoareTripleChecker+Valid, 4116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:20:34,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1453 Valid, 3010 Invalid, 5905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1789 Valid, 4116 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-02-05 12:20:34,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80232 states. [2025-02-05 12:20:35,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80232 to 78762. [2025-02-05 12:20:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78762 states, 78761 states have (on average 1.1383806706364825) internal successors, (89660), 78761 states have internal predecessors, (89660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:35,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78762 states to 78762 states and 89660 transitions. [2025-02-05 12:20:35,398 INFO L78 Accepts]: Start accepts. Automaton has 78762 states and 89660 transitions. Word has length 581 [2025-02-05 12:20:35,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:20:35,399 INFO L471 AbstractCegarLoop]: Abstraction has 78762 states and 89660 transitions. [2025-02-05 12:20:35,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:35,399 INFO L276 IsEmpty]: Start isEmpty. Operand 78762 states and 89660 transitions. [2025-02-05 12:20:35,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2025-02-05 12:20:35,414 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:20:35,414 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:20:35,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:20:35,415 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:20:35,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:20:35,415 INFO L85 PathProgramCache]: Analyzing trace with hash 149540804, now seen corresponding path program 1 times [2025-02-05 12:20:35,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:20:35,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157381264] [2025-02-05 12:20:35,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:20:35,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:20:35,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 726 statements into 1 equivalence classes. [2025-02-05 12:20:35,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 726 of 726 statements. [2025-02-05 12:20:35,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:20:35,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:20:37,737 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 35 proven. 37 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-02-05 12:20:37,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:20:37,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157381264] [2025-02-05 12:20:37,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157381264] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:20:37,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715224732] [2025-02-05 12:20:37,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:20:37,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:20:37,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:20:37,757 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:20:37,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 12:20:37,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 726 statements into 1 equivalence classes. [2025-02-05 12:20:38,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 726 of 726 statements. [2025-02-05 12:20:38,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:20:38,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:20:38,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 12:20:38,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:20:38,168 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-02-05 12:20:38,169 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:20:38,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715224732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:20:38,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 12:20:38,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-05 12:20:38,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683048327] [2025-02-05 12:20:38,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:20:38,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:20:38,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:20:38,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:20:38,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:20:38,171 INFO L87 Difference]: Start difference. First operand 78762 states and 89660 transitions. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)