./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label40.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem19_label40.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e138a285e39cee370658c394a82aa6106f1f1589e50dc2e37a5e2dc34c4d4ddf --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:31:25,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:31:25,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:31:25,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:31:25,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:31:25,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:31:25,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:31:25,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:31:25,651 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:31:25,652 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:31:25,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:31:25,652 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:31:25,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:31:25,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:31:25,653 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:31:25,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:31:25,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:31:25,653 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:31:25,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:31:25,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:31:25,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:31:25,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:31:25,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:31:25,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:31:25,653 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:31:25,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:31:25,653 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:31:25,654 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:31:25,654 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:31:25,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:31:25,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:31:25,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:31:25,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:31:25,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:31:25,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:31:25,655 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:31:25,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:31:25,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:31:25,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:31:25,655 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:31:25,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:31:25,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:31:25,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:31:25,655 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e138a285e39cee370658c394a82aa6106f1f1589e50dc2e37a5e2dc34c4d4ddf [2025-03-16 15:31:25,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:31:25,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:31:25,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:31:25,893 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:31:25,893 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:31:25,894 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label40.c [2025-03-16 15:31:27,068 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dcfe3a10/136ca93db3574e0da9021267bf2c6dab/FLAGec5a0c106 [2025-03-16 15:31:27,486 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:31:27,487 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label40.c [2025-03-16 15:31:27,525 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dcfe3a10/136ca93db3574e0da9021267bf2c6dab/FLAGec5a0c106 [2025-03-16 15:31:27,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dcfe3a10/136ca93db3574e0da9021267bf2c6dab [2025-03-16 15:31:27,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:31:27,541 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:31:27,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:31:27,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:31:27,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:31:27,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:31:27" (1/1) ... [2025-03-16 15:31:27,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e3291da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:27, skipping insertion in model container [2025-03-16 15:31:27,547 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:31:27" (1/1) ... [2025-03-16 15:31:27,654 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:31:27,879 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label40.c[6144,6157] [2025-03-16 15:31:28,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:31:28,598 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:31:28,616 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label40.c[6144,6157] [2025-03-16 15:31:29,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:31:29,070 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:31:29,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:29 WrapperNode [2025-03-16 15:31:29,072 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:31:29,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:31:29,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:31:29,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:31:29,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:29" (1/1) ... [2025-03-16 15:31:29,133 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:29" (1/1) ... [2025-03-16 15:31:29,635 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-03-16 15:31:29,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:31:29,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:31:29,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:31:29,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:31:29,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:29" (1/1) ... [2025-03-16 15:31:29,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:29" (1/1) ... [2025-03-16 15:31:29,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:29" (1/1) ... [2025-03-16 15:31:29,934 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:31:29,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:29" (1/1) ... [2025-03-16 15:31:29,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:29" (1/1) ... [2025-03-16 15:31:30,106 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:29" (1/1) ... [2025-03-16 15:31:30,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:29" (1/1) ... [2025-03-16 15:31:30,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:29" (1/1) ... [2025-03-16 15:31:30,157 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:29" (1/1) ... [2025-03-16 15:31:30,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:31:30,214 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:31:30,214 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:31:30,214 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:31:30,215 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:29" (1/1) ... [2025-03-16 15:31:30,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:31:30,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:31:30,239 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:31:30,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:31:30,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:31:30,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:31:30,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:31:30,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:31:30,318 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:31:30,320 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:31:35,965 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-03-16 15:31:35,965 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-03-16 15:31:35,965 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-03-16 15:31:35,965 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-03-16 15:31:35,965 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-03-16 15:31:36,278 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-03-16 15:31:36,278 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:31:36,322 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:31:36,325 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:31:36,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:31:36 BoogieIcfgContainer [2025-03-16 15:31:36,326 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:31:36,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:31:36,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:31:36,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:31:36,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:31:27" (1/3) ... [2025-03-16 15:31:36,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@641142b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:31:36, skipping insertion in model container [2025-03-16 15:31:36,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:29" (2/3) ... [2025-03-16 15:31:36,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@641142b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:31:36, skipping insertion in model container [2025-03-16 15:31:36,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:31:36" (3/3) ... [2025-03-16 15:31:36,336 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label40.c [2025-03-16 15:31:36,348 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:31:36,350 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label40.c that has 1 procedures, 1687 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:31:36,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:31:36,450 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;@53943423, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:31:36,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:31:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 1687 states, 1685 states have (on average 1.9008902077151335) internal successors, (3203), 1686 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:31:36,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 15:31:36,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:31:36,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:31:36,465 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:31:36,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:31:36,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1559167552, now seen corresponding path program 1 times [2025-03-16 15:31:36,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:31:36,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634896530] [2025-03-16 15:31:36,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:31:36,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:31:36,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 15:31:36,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 15:31:36,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:31:36,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:31:36,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:31:36,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:31:36,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634896530] [2025-03-16 15:31:36,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634896530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:31:36,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:31:36,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:31:36,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713316947] [2025-03-16 15:31:36,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:31:36,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:31:36,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:31:36,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:31:36,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:31:36,601 INFO L87 Difference]: Start difference. First operand has 1687 states, 1685 states have (on average 1.9008902077151335) internal successors, (3203), 1686 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:31:36,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:31:36,686 INFO L93 Difference]: Finished difference Result 3373 states and 6405 transitions. [2025-03-16 15:31:36,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:31:36,688 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-16 15:31:36,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:31:36,704 INFO L225 Difference]: With dead ends: 3373 [2025-03-16 15:31:36,705 INFO L226 Difference]: Without dead ends: 1684 [2025-03-16 15:31:36,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:31:36,715 INFO L435 NwaCegarLoop]: 3141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:31:36,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:31:36,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2025-03-16 15:31:36,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2025-03-16 15:31:36,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.8645276292335116) internal successors, (3138), 1683 states have internal predecessors, (3138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:31:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 3138 transitions. [2025-03-16 15:31:36,813 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 3138 transitions. Word has length 45 [2025-03-16 15:31:36,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:31:36,814 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 3138 transitions. [2025-03-16 15:31:36,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:31:36,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 3138 transitions. [2025-03-16 15:31:36,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 15:31:36,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:31:36,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:31:36,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:31:36,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:31:36,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:31:36,817 INFO L85 PathProgramCache]: Analyzing trace with hash 112555200, now seen corresponding path program 1 times [2025-03-16 15:31:36,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:31:36,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938394143] [2025-03-16 15:31:36,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:31:36,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:31:36,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 15:31:36,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 15:31:36,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:31:36,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:31:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:31:37,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:31:37,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938394143] [2025-03-16 15:31:37,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938394143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:31:37,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:31:37,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:31:37,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797654893] [2025-03-16 15:31:37,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:31:37,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:31:37,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:31:37,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:31:37,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:31:37,009 INFO L87 Difference]: Start difference. First operand 1684 states and 3138 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:31:41,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:31:41,976 INFO L93 Difference]: Finished difference Result 4789 states and 8995 transitions. [2025-03-16 15:31:41,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:31:41,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-16 15:31:41,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:31:41,989 INFO L225 Difference]: With dead ends: 4789 [2025-03-16 15:31:41,989 INFO L226 Difference]: Without dead ends: 3106 [2025-03-16 15:31:41,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:31:41,994 INFO L435 NwaCegarLoop]: 1214 mSDtfsCounter, 1503 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4578 mSolverCounterSat, 1050 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 5628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1050 IncrementalHoareTripleChecker+Valid, 4578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:31:41,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1392 Invalid, 5628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1050 Valid, 4578 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-16 15:31:42,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2025-03-16 15:31:42,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 3105. [2025-03-16 15:31:42,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3105 states, 3104 states have (on average 1.653028350515464) internal successors, (5131), 3104 states have internal predecessors, (5131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:31:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3105 states to 3105 states and 5131 transitions. [2025-03-16 15:31:42,060 INFO L78 Accepts]: Start accepts. Automaton has 3105 states and 5131 transitions. Word has length 45 [2025-03-16 15:31:42,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:31:42,060 INFO L471 AbstractCegarLoop]: Abstraction has 3105 states and 5131 transitions. [2025-03-16 15:31:42,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:31:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3105 states and 5131 transitions. [2025-03-16 15:31:42,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 15:31:42,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:31:42,065 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:31:42,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:31:42,067 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:31:42,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:31:42,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1513055598, now seen corresponding path program 1 times [2025-03-16 15:31:42,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:31:42,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403794302] [2025-03-16 15:31:42,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:31:42,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:31:42,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 15:31:42,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 15:31:42,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:31:42,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:31:42,254 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:31:42,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:31:42,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403794302] [2025-03-16 15:31:42,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403794302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:31:42,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:31:42,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:31:42,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274613269] [2025-03-16 15:31:42,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:31:42,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:31:42,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:31:42,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:31:42,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:31:42,256 INFO L87 Difference]: Start difference. First operand 3105 states and 5131 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:31:46,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:31:46,965 INFO L93 Difference]: Finished difference Result 9096 states and 15083 transitions. [2025-03-16 15:31:46,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:31:46,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2025-03-16 15:31:46,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:31:46,986 INFO L225 Difference]: With dead ends: 9096 [2025-03-16 15:31:46,986 INFO L226 Difference]: Without dead ends: 5992 [2025-03-16 15:31:46,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:31:46,993 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 2533 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 5120 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 5554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:31:46,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 989 Invalid, 5554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5120 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-16 15:31:47,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2025-03-16 15:31:47,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 5990. [2025-03-16 15:31:47,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5990 states, 5989 states have (on average 1.606278176657205) internal successors, (9620), 5989 states have internal predecessors, (9620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:31:47,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5990 states to 5990 states and 9620 transitions. [2025-03-16 15:31:47,079 INFO L78 Accepts]: Start accepts. Automaton has 5990 states and 9620 transitions. Word has length 114 [2025-03-16 15:31:47,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:31:47,080 INFO L471 AbstractCegarLoop]: Abstraction has 5990 states and 9620 transitions. [2025-03-16 15:31:47,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:31:47,081 INFO L276 IsEmpty]: Start isEmpty. Operand 5990 states and 9620 transitions. [2025-03-16 15:31:47,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-16 15:31:47,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:31:47,083 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:31:47,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:31:47,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:31:47,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:31:47,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1912223704, now seen corresponding path program 1 times [2025-03-16 15:31:47,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:31:47,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873082752] [2025-03-16 15:31:47,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:31:47,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:31:47,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-16 15:31:47,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-16 15:31:47,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:31:47,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:31:47,252 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:31:47,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:31:47,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873082752] [2025-03-16 15:31:47,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873082752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:31:47,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:31:47,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:31:47,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289564867] [2025-03-16 15:31:47,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:31:47,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:31:47,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:31:47,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:31:47,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:31:47,253 INFO L87 Difference]: Start difference. First operand 5990 states and 9620 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:31:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:31:51,517 INFO L93 Difference]: Finished difference Result 17558 states and 28307 transitions. [2025-03-16 15:31:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:31:51,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-03-16 15:31:51,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:31:51,545 INFO L225 Difference]: With dead ends: 17558 [2025-03-16 15:31:51,545 INFO L226 Difference]: Without dead ends: 11569 [2025-03-16 15:31:51,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:31:51,556 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 1446 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 4825 mSolverCounterSat, 1045 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1446 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 5870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1045 IncrementalHoareTripleChecker+Valid, 4825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:31:51,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1446 Valid, 1730 Invalid, 5870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1045 Valid, 4825 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-16 15:31:51,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11569 states. [2025-03-16 15:31:51,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11569 to 11516. [2025-03-16 15:31:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11516 states, 11515 states have (on average 1.4298740772904908) internal successors, (16465), 11515 states have internal predecessors, (16465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:31:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11516 states to 11516 states and 16465 transitions. [2025-03-16 15:31:51,702 INFO L78 Accepts]: Start accepts. Automaton has 11516 states and 16465 transitions. Word has length 119 [2025-03-16 15:31:51,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:31:51,703 INFO L471 AbstractCegarLoop]: Abstraction has 11516 states and 16465 transitions. [2025-03-16 15:31:51,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:31:51,704 INFO L276 IsEmpty]: Start isEmpty. Operand 11516 states and 16465 transitions. [2025-03-16 15:31:51,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-16 15:31:51,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:31:51,706 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:31:51,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:31:51,706 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:31:51,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:31:51,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2035390696, now seen corresponding path program 1 times [2025-03-16 15:31:51,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:31:51,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612620019] [2025-03-16 15:31:51,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:31:51,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:31:51,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 15:31:51,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 15:31:51,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:31:51,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:31:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:31:51,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:31:51,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612620019] [2025-03-16 15:31:51,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612620019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:31:51,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:31:51,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:31:51,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530570524] [2025-03-16 15:31:51,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:31:51,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:31:51,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:31:51,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:31:51,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:31:51,854 INFO L87 Difference]: Start difference. First operand 11516 states and 16465 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:31:56,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:31:56,577 INFO L93 Difference]: Finished difference Result 34167 states and 48916 transitions. [2025-03-16 15:31:56,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:31:56,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-03-16 15:31:56,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:31:56,617 INFO L225 Difference]: With dead ends: 34167 [2025-03-16 15:31:56,618 INFO L226 Difference]: Without dead ends: 22652 [2025-03-16 15:31:56,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:31:56,626 INFO L435 NwaCegarLoop]: 1803 mSDtfsCounter, 1748 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 4312 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 5742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:31:56,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 2075 Invalid, 5742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4312 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-16 15:31:56,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22652 states. [2025-03-16 15:31:56,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22652 to 22635. [2025-03-16 15:31:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22635 states, 22634 states have (on average 1.2716709375276134) internal successors, (28783), 22634 states have internal predecessors, (28783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:31:56,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22635 states to 22635 states and 28783 transitions. [2025-03-16 15:31:56,876 INFO L78 Accepts]: Start accepts. Automaton has 22635 states and 28783 transitions. Word has length 142 [2025-03-16 15:31:56,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:31:56,877 INFO L471 AbstractCegarLoop]: Abstraction has 22635 states and 28783 transitions. [2025-03-16 15:31:56,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:31:56,877 INFO L276 IsEmpty]: Start isEmpty. Operand 22635 states and 28783 transitions. [2025-03-16 15:31:56,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-16 15:31:56,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:31:56,878 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:31:56,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:31:56,879 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:31:56,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:31:56,879 INFO L85 PathProgramCache]: Analyzing trace with hash 42479830, now seen corresponding path program 1 times [2025-03-16 15:31:56,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:31:56,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548433013] [2025-03-16 15:31:56,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:31:56,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:31:56,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-16 15:31:56,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-16 15:31:56,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:31:56,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:31:57,026 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:31:57,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:31:57,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548433013] [2025-03-16 15:31:57,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548433013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:31:57,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:31:57,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:31:57,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595998343] [2025-03-16 15:31:57,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:31:57,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:31:57,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:31:57,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:31:57,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:31:57,028 INFO L87 Difference]: Start difference. First operand 22635 states and 28783 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:32:01,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:32:01,615 INFO L93 Difference]: Finished difference Result 67253 states and 85519 transitions. [2025-03-16 15:32:01,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:32:01,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 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 183 [2025-03-16 15:32:01,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:32:01,681 INFO L225 Difference]: With dead ends: 67253 [2025-03-16 15:32:01,681 INFO L226 Difference]: Without dead ends: 44619 [2025-03-16 15:32:01,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:32:01,707 INFO L435 NwaCegarLoop]: 1666 mSDtfsCounter, 1469 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 4396 mSolverCounterSat, 1424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 5820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1424 IncrementalHoareTripleChecker+Valid, 4396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:32:01,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 1885 Invalid, 5820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1424 Valid, 4396 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-16 15:32:01,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44619 states. [2025-03-16 15:32:02,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44619 to 44567. [2025-03-16 15:32:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44567 states, 44566 states have (on average 1.1781178476865772) internal successors, (52504), 44566 states have internal predecessors, (52504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:32:02,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44567 states to 44567 states and 52504 transitions. [2025-03-16 15:32:02,135 INFO L78 Accepts]: Start accepts. Automaton has 44567 states and 52504 transitions. Word has length 183 [2025-03-16 15:32:02,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:32:02,135 INFO L471 AbstractCegarLoop]: Abstraction has 44567 states and 52504 transitions. [2025-03-16 15:32:02,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:32:02,135 INFO L276 IsEmpty]: Start isEmpty. Operand 44567 states and 52504 transitions. [2025-03-16 15:32:02,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-16 15:32:02,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:32:02,137 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:32:02,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:32:02,137 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:32:02,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:32:02,138 INFO L85 PathProgramCache]: Analyzing trace with hash 164397413, now seen corresponding path program 1 times [2025-03-16 15:32:02,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:32:02,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249691926] [2025-03-16 15:32:02,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:02,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:32:02,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-16 15:32:02,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-16 15:32:02,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:02,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:32:02,328 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:32:02,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:32:02,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249691926] [2025-03-16 15:32:02,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249691926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:32:02,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:32:02,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:32:02,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211909264] [2025-03-16 15:32:02,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:32:02,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:32:02,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:32:02,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:32:02,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:32:02,330 INFO L87 Difference]: Start difference. First operand 44567 states and 52504 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:32:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:32:06,822 INFO L93 Difference]: Finished difference Result 106904 states and 127852 transitions. [2025-03-16 15:32:06,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:32:06,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2025-03-16 15:32:06,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:32:06,891 INFO L225 Difference]: With dead ends: 106904 [2025-03-16 15:32:06,892 INFO L226 Difference]: Without dead ends: 62336 [2025-03-16 15:32:06,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:32:06,918 INFO L435 NwaCegarLoop]: 3087 mSDtfsCounter, 1434 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 3732 mSolverCounterSat, 1895 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1434 SdHoareTripleChecker+Valid, 3276 SdHoareTripleChecker+Invalid, 5627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1895 IncrementalHoareTripleChecker+Valid, 3732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:32:06,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1434 Valid, 3276 Invalid, 5627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1895 Valid, 3732 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-16 15:32:06,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62336 states. [2025-03-16 15:32:07,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62336 to 62325. [2025-03-16 15:32:07,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62325 states, 62324 states have (on average 1.142080097554714) internal successors, (71179), 62324 states have internal predecessors, (71179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:32:07,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62325 states to 62325 states and 71179 transitions. [2025-03-16 15:32:07,623 INFO L78 Accepts]: Start accepts. Automaton has 62325 states and 71179 transitions. Word has length 252 [2025-03-16 15:32:07,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:32:07,623 INFO L471 AbstractCegarLoop]: Abstraction has 62325 states and 71179 transitions. [2025-03-16 15:32:07,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:32:07,624 INFO L276 IsEmpty]: Start isEmpty. Operand 62325 states and 71179 transitions. [2025-03-16 15:32:07,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-16 15:32:07,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:32:07,628 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:32:07,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:32:07,628 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:32:07,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:32:07,629 INFO L85 PathProgramCache]: Analyzing trace with hash -510671844, now seen corresponding path program 1 times [2025-03-16 15:32:07,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:32:07,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630442736] [2025-03-16 15:32:07,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:07,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:32:07,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-16 15:32:07,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-16 15:32:07,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:07,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:32:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-16 15:32:08,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:32:08,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630442736] [2025-03-16 15:32:08,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630442736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:32:08,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:32:08,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:32:08,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756512693] [2025-03-16 15:32:08,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:32:08,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:32:08,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:32:08,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:32:08,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:32:08,406 INFO L87 Difference]: Start difference. First operand 62325 states and 71179 transitions. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:32:15,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:32:15,060 INFO L93 Difference]: Finished difference Result 149301 states and 169014 transitions. [2025-03-16 15:32:15,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:32:15,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 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 471 [2025-03-16 15:32:15,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:32:15,181 INFO L225 Difference]: With dead ends: 149301 [2025-03-16 15:32:15,182 INFO L226 Difference]: Without dead ends: 88342 [2025-03-16 15:32:15,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:32:15,211 INFO L435 NwaCegarLoop]: 1796 mSDtfsCounter, 3759 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 9421 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3759 SdHoareTripleChecker+Valid, 2152 SdHoareTripleChecker+Invalid, 9688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 9421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:32:15,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3759 Valid, 2152 Invalid, 9688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 9421 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2025-03-16 15:32:15,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88342 states. [2025-03-16 15:32:15,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88342 to 86932. [2025-03-16 15:32:15,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86932 states, 86931 states have (on average 1.1149417353993396) internal successors, (96923), 86931 states have internal predecessors, (96923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:32:15,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86932 states to 86932 states and 96923 transitions. [2025-03-16 15:32:15,900 INFO L78 Accepts]: Start accepts. Automaton has 86932 states and 96923 transitions. Word has length 471 [2025-03-16 15:32:15,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:32:15,900 INFO L471 AbstractCegarLoop]: Abstraction has 86932 states and 96923 transitions. [2025-03-16 15:32:15,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:32:15,900 INFO L276 IsEmpty]: Start isEmpty. Operand 86932 states and 96923 transitions. [2025-03-16 15:32:15,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-03-16 15:32:15,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:32:15,905 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:32:15,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:32:15,905 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:32:15,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:32:15,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1465695690, now seen corresponding path program 1 times [2025-03-16 15:32:15,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:32:15,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818452360] [2025-03-16 15:32:15,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:15,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:32:15,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-16 15:32:15,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-16 15:32:15,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:15,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:32:16,460 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 15:32:16,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:32:16,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818452360] [2025-03-16 15:32:16,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818452360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:32:16,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:32:16,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:32:16,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685540468] [2025-03-16 15:32:16,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:32:16,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:32:16,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:32:16,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:32:16,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:32:16,463 INFO L87 Difference]: Start difference. First operand 86932 states and 96923 transitions. Second operand has 4 states, 4 states have (on average 120.5) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:32:21,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:32:21,498 INFO L93 Difference]: Finished difference Result 173894 states and 193882 transitions. [2025-03-16 15:32:21,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:32:21,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 120.5) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 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 499 [2025-03-16 15:32:21,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:32:21,587 INFO L225 Difference]: With dead ends: 173894 [2025-03-16 15:32:21,587 INFO L226 Difference]: Without dead ends: 88297 [2025-03-16 15:32:21,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:32:21,621 INFO L435 NwaCegarLoop]: 1768 mSDtfsCounter, 1138 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 7313 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2109 SdHoareTripleChecker+Invalid, 7321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:32:21,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2109 Invalid, 7321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7313 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-16 15:32:21,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88297 states. [2025-03-16 15:32:22,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88297 to 88297. [2025-03-16 15:32:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88297 states, 88296 states have (on average 1.1131534837365227) internal successors, (98287), 88296 states have internal predecessors, (98287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:32:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88297 states to 88297 states and 98287 transitions. [2025-03-16 15:32:22,685 INFO L78 Accepts]: Start accepts. Automaton has 88297 states and 98287 transitions. Word has length 499 [2025-03-16 15:32:22,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:32:22,686 INFO L471 AbstractCegarLoop]: Abstraction has 88297 states and 98287 transitions. [2025-03-16 15:32:22,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.5) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:32:22,686 INFO L276 IsEmpty]: Start isEmpty. Operand 88297 states and 98287 transitions. [2025-03-16 15:32:22,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2025-03-16 15:32:22,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:32:22,691 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:32:22,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:32:22,692 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:32:22,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:32:22,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1959247408, now seen corresponding path program 1 times [2025-03-16 15:32:22,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:32:22,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504602936] [2025-03-16 15:32:22,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:22,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:32:22,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 617 statements into 1 equivalence classes. [2025-03-16 15:32:22,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 617 of 617 statements. [2025-03-16 15:32:22,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:22,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:32:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 15:32:23,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:32:23,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504602936] [2025-03-16 15:32:23,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504602936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:32:23,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:32:23,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:32:23,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105111019] [2025-03-16 15:32:23,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:32:23,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:32:23,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:32:23,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:32:23,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:32:23,258 INFO L87 Difference]: Start difference. First operand 88297 states and 98287 transitions. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 2 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:32:27,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:32:27,477 INFO L93 Difference]: Finished difference Result 193002 states and 215471 transitions. [2025-03-16 15:32:27,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:32:27,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 2 states have internal predecessors, (534), 0 states have call successors, (0), 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 617 [2025-03-16 15:32:27,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:32:27,586 INFO L225 Difference]: With dead ends: 193002 [2025-03-16 15:32:27,586 INFO L226 Difference]: Without dead ends: 107436 [2025-03-16 15:32:27,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:32:27,816 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 1386 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 3925 mSolverCounterSat, 1668 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1386 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 5593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1668 IncrementalHoareTripleChecker+Valid, 3925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:32:27,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1386 Valid, 750 Invalid, 5593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1668 Valid, 3925 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-16 15:32:27,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107436 states. [2025-03-16 15:32:28,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107436 to 107413. [2025-03-16 15:32:28,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107413 states, 107412 states have (on average 1.0961810598443378) internal successors, (117743), 107412 states have internal predecessors, (117743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:32:28,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107413 states to 107413 states and 117743 transitions. [2025-03-16 15:32:28,727 INFO L78 Accepts]: Start accepts. Automaton has 107413 states and 117743 transitions. Word has length 617 [2025-03-16 15:32:28,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:32:28,728 INFO L471 AbstractCegarLoop]: Abstraction has 107413 states and 117743 transitions. [2025-03-16 15:32:28,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 2 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:32:28,728 INFO L276 IsEmpty]: Start isEmpty. Operand 107413 states and 117743 transitions. [2025-03-16 15:32:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 752 [2025-03-16 15:32:28,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:32:28,732 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:32:28,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:32:28,733 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:32:28,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:32:28,733 INFO L85 PathProgramCache]: Analyzing trace with hash 982335963, now seen corresponding path program 1 times [2025-03-16 15:32:28,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:32:28,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534648505] [2025-03-16 15:32:28,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:28,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:32:28,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 751 statements into 1 equivalence classes. [2025-03-16 15:32:28,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 751 of 751 statements. [2025-03-16 15:32:28,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:28,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:32:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 87 proven. 37 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-16 15:32:29,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:32:29,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534648505] [2025-03-16 15:32:29,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534648505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:32:29,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966278245] [2025-03-16 15:32:29,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:29,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:32:29,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:32:29,917 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:32:29,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:32:29,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 751 statements into 1 equivalence classes. [2025-03-16 15:32:30,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 751 of 751 statements. [2025-03-16 15:32:30,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:30,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:32:30,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:32:30,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:32:30,175 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-16 15:32:30,175 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:32:30,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966278245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:32:30,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:32:30,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 15:32:30,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811813116] [2025-03-16 15:32:30,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:32:30,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:32:30,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:32:30,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:32:30,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:32:30,177 INFO L87 Difference]: Start difference. First operand 107413 states and 117743 transitions. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:32:35,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:32:35,182 INFO L93 Difference]: Finished difference Result 264102 states and 292009 transitions. [2025-03-16 15:32:35,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:32:35,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 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 751 [2025-03-16 15:32:35,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:32:35,349 INFO L225 Difference]: With dead ends: 264102 [2025-03-16 15:32:35,350 INFO L226 Difference]: Without dead ends: 159420 [2025-03-16 15:32:35,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 753 GetRequests, 750 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:32:35,411 INFO L435 NwaCegarLoop]: 3208 mSDtfsCounter, 1430 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 5094 mSolverCounterSat, 988 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1430 SdHoareTripleChecker+Valid, 3380 SdHoareTripleChecker+Invalid, 6082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 988 IncrementalHoareTripleChecker+Valid, 5094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:32:35,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1430 Valid, 3380 Invalid, 6082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [988 Valid, 5094 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-16 15:32:35,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159420 states. [2025-03-16 15:32:36,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159420 to 155209. [2025-03-16 15:32:36,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155209 states, 155208 states have (on average 1.085369310860265) internal successors, (168458), 155208 states have internal predecessors, (168458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:32:36,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155209 states to 155209 states and 168458 transitions. [2025-03-16 15:32:36,880 INFO L78 Accepts]: Start accepts. Automaton has 155209 states and 168458 transitions. Word has length 751 [2025-03-16 15:32:36,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:32:36,881 INFO L471 AbstractCegarLoop]: Abstraction has 155209 states and 168458 transitions. [2025-03-16 15:32:36,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:32:36,881 INFO L276 IsEmpty]: Start isEmpty. Operand 155209 states and 168458 transitions. [2025-03-16 15:32:36,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-03-16 15:32:36,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:32:36,886 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:32:36,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:32:37,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-16 15:32:37,087 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:32:37,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:32:37,087 INFO L85 PathProgramCache]: Analyzing trace with hash 865950145, now seen corresponding path program 1 times [2025-03-16 15:32:37,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:32:37,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817739633] [2025-03-16 15:32:37,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:37,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:32:37,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-16 15:32:37,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-16 15:32:37,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:37,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:32:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-16 15:32:37,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:32:37,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817739633] [2025-03-16 15:32:37,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817739633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:32:37,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:32:37,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:32:37,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463384604] [2025-03-16 15:32:37,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:32:37,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:32:37,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:32:37,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:32:37,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:32:37,450 INFO L87 Difference]: Start difference. First operand 155209 states and 168458 transitions. Second operand has 4 states, 4 states have (on average 155.25) internal successors, (621), 4 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:32:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:32:46,623 INFO L93 Difference]: Finished difference Result 494977 states and 542184 transitions. [2025-03-16 15:32:46,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:32:46,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 155.25) internal successors, (621), 4 states have internal predecessors, (621), 0 states have call successors, (0), 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 829 [2025-03-16 15:32:46,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:32:47,022 INFO L225 Difference]: With dead ends: 494977 [2025-03-16 15:32:47,022 INFO L226 Difference]: Without dead ends: 342499 [2025-03-16 15:32:47,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:32:47,077 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 3337 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 8816 mSolverCounterSat, 3022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3337 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 11838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3022 IncrementalHoareTripleChecker+Valid, 8816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:32:47,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3337 Valid, 1051 Invalid, 11838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3022 Valid, 8816 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2025-03-16 15:32:47,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342499 states. [2025-03-16 15:32:49,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342499 to 330046. [2025-03-16 15:32:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330046 states, 330045 states have (on average 1.0814222303019285) internal successors, (356918), 330045 states have internal predecessors, (356918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:32:50,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330046 states to 330046 states and 356918 transitions. [2025-03-16 15:32:50,278 INFO L78 Accepts]: Start accepts. Automaton has 330046 states and 356918 transitions. Word has length 829 [2025-03-16 15:32:50,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:32:50,279 INFO L471 AbstractCegarLoop]: Abstraction has 330046 states and 356918 transitions. [2025-03-16 15:32:50,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.25) internal successors, (621), 4 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:32:50,279 INFO L276 IsEmpty]: Start isEmpty. Operand 330046 states and 356918 transitions. [2025-03-16 15:32:50,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 906 [2025-03-16 15:32:50,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:32:50,296 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:32:50,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:32:50,296 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:32:50,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:32:50,297 INFO L85 PathProgramCache]: Analyzing trace with hash 72917361, now seen corresponding path program 1 times [2025-03-16 15:32:50,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:32:50,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321572794] [2025-03-16 15:32:50,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:50,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:32:50,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 905 statements into 1 equivalence classes. [2025-03-16 15:32:50,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 905 of 905 statements. [2025-03-16 15:32:50,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:50,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat