./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/Problem03_label01.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 92f387aee9179611b681311904b53986764751325111bb2d842a850437b442f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:59:13,617 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:59:13,673 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:59:13,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:59:13,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:59:13,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:59:13,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:59:13,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:59:13,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:59:13,701 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:59:13,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:59:13,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:59:13,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:59:13,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:59:13,702 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:59:13,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:59:13,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:59:13,703 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:59:13,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:59:13,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:59:13,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:59:13,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:59:13,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:59:13,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:59:13,703 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:59:13,703 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:59:13,703 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:59:13,704 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:59:13,704 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:59:13,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:59:13,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:59:13,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:59:13,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:59:13,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:59:13,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:59:13,705 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:59:13,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:59:13,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:59:13,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:59:13,705 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:59:13,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:59:13,705 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:59:13,705 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:59:13,705 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 -> 92f387aee9179611b681311904b53986764751325111bb2d842a850437b442f7 [2025-03-08 00:59:13,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:59:13,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:59:13,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:59:13,942 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:59:13,942 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:59:13,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label01.c [2025-03-08 00:59:15,121 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2477c5ac/12d6b4d50fbc44cd858358f96e81a51a/FLAGa6d227f6a [2025-03-08 00:59:15,471 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:59:15,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label01.c [2025-03-08 00:59:15,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2477c5ac/12d6b4d50fbc44cd858358f96e81a51a/FLAGa6d227f6a [2025-03-08 00:59:15,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2477c5ac/12d6b4d50fbc44cd858358f96e81a51a [2025-03-08 00:59:15,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:59:15,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:59:15,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:59:15,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:59:15,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:59:15,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:59:15" (1/1) ... [2025-03-08 00:59:15,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d076140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:15, skipping insertion in model container [2025-03-08 00:59:15,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:59:15" (1/1) ... [2025-03-08 00:59:15,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:59:16,005 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/Problem03_label01.c[59340,59353] [2025-03-08 00:59:16,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:59:16,041 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:59:16,150 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/Problem03_label01.c[59340,59353] [2025-03-08 00:59:16,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:59:16,178 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:59:16,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:16 WrapperNode [2025-03-08 00:59:16,179 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:59:16,180 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:59:16,180 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:59:16,180 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:59:16,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:16" (1/1) ... [2025-03-08 00:59:16,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:16" (1/1) ... [2025-03-08 00:59:16,281 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-08 00:59:16,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:59:16,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:59:16,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:59:16,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:59:16,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:16" (1/1) ... [2025-03-08 00:59:16,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:16" (1/1) ... [2025-03-08 00:59:16,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:16" (1/1) ... [2025-03-08 00:59:16,335 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-08 00:59:16,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:16" (1/1) ... [2025-03-08 00:59:16,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:16" (1/1) ... [2025-03-08 00:59:16,378 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:16" (1/1) ... [2025-03-08 00:59:16,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:16" (1/1) ... [2025-03-08 00:59:16,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:16" (1/1) ... [2025-03-08 00:59:16,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:16" (1/1) ... [2025-03-08 00:59:16,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:59:16,400 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:59:16,400 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:59:16,400 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:59:16,401 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:16" (1/1) ... [2025-03-08 00:59:16,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:59:16,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:59:16,426 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-08 00:59:16,432 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-08 00:59:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:59:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:59:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:59:16,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:59:16,515 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:59:16,517 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:59:17,841 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-08 00:59:17,842 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:59:17,862 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:59:17,862 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:59:17,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:59:17 BoogieIcfgContainer [2025-03-08 00:59:17,862 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:59:17,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:59:17,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:59:17,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:59:17,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:59:15" (1/3) ... [2025-03-08 00:59:17,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b8d2a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:59:17, skipping insertion in model container [2025-03-08 00:59:17,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:16" (2/3) ... [2025-03-08 00:59:17,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b8d2a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:59:17, skipping insertion in model container [2025-03-08 00:59:17,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:59:17" (3/3) ... [2025-03-08 00:59:17,871 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label01.c [2025-03-08 00:59:17,883 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:59:17,886 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label01.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 00:59:17,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:59:17,951 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;@76237a11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:59:17,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:59:17,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:17,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-08 00:59:17,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:17,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:59:17,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:17,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:17,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1932181325, now seen corresponding path program 1 times [2025-03-08 00:59:17,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:17,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127306064] [2025-03-08 00:59:17,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:17,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:18,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-08 00:59:18,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-08 00:59:18,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:18,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:18,753 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-08 00:59:18,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:18,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127306064] [2025-03-08 00:59:18,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127306064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:18,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:18,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:59:18,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939101214] [2025-03-08 00:59:18,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:18,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:18,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:18,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:18,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:18,778 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 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-08 00:59:19,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:19,642 INFO L93 Difference]: Finished difference Result 860 states and 1504 transitions. [2025-03-08 00:59:19,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:19,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 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 186 [2025-03-08 00:59:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:19,653 INFO L225 Difference]: With dead ends: 860 [2025-03-08 00:59:19,653 INFO L226 Difference]: Without dead ends: 465 [2025-03-08 00:59:19,656 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-08 00:59:19,657 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 118 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:19,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 170 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 00:59:19,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-08 00:59:19,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 459. [2025-03-08 00:59:19,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.556768558951965) internal successors, (713), 458 states have internal predecessors, (713), 0 states have call successors, (0), 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-08 00:59:19,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 713 transitions. [2025-03-08 00:59:19,711 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 713 transitions. Word has length 186 [2025-03-08 00:59:19,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:19,712 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 713 transitions. [2025-03-08 00:59:19,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 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-08 00:59:19,712 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 713 transitions. [2025-03-08 00:59:19,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 00:59:19,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:19,714 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:59:19,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:59:19,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:19,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:19,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1358650505, now seen corresponding path program 1 times [2025-03-08 00:59:19,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:19,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458422844] [2025-03-08 00:59:19,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:19,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:19,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 00:59:19,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 00:59:19,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:19,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:19,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:59:19,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:19,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458422844] [2025-03-08 00:59:19,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458422844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:19,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:19,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:59:19,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170393007] [2025-03-08 00:59:19,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:19,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:19,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:19,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:19,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:19,912 INFO L87 Difference]: Start difference. First operand 459 states and 713 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 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-08 00:59:20,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:20,587 INFO L93 Difference]: Finished difference Result 1343 states and 2102 transitions. [2025-03-08 00:59:20,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:20,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 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 194 [2025-03-08 00:59:20,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:20,591 INFO L225 Difference]: With dead ends: 1343 [2025-03-08 00:59:20,591 INFO L226 Difference]: Without dead ends: 886 [2025-03-08 00:59:20,592 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-08 00:59:20,593 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:20,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 92 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:59:20,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-08 00:59:20,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 868. [2025-03-08 00:59:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 867 states have (on average 1.532871972318339) internal successors, (1329), 867 states have internal predecessors, (1329), 0 states have call successors, (0), 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-08 00:59:20,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1329 transitions. [2025-03-08 00:59:20,636 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1329 transitions. Word has length 194 [2025-03-08 00:59:20,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:20,636 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1329 transitions. [2025-03-08 00:59:20,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 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-08 00:59:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1329 transitions. [2025-03-08 00:59:20,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-08 00:59:20,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:20,640 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 00:59:20,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:59:20,640 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:20,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:20,641 INFO L85 PathProgramCache]: Analyzing trace with hash -665794423, now seen corresponding path program 1 times [2025-03-08 00:59:20,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:20,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979433993] [2025-03-08 00:59:20,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:20,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:20,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-08 00:59:20,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-08 00:59:20,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:20,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:20,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:59:20,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:20,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979433993] [2025-03-08 00:59:20,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979433993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:20,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:20,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:59:20,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791224158] [2025-03-08 00:59:20,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:20,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:20,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:20,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:20,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:20,818 INFO L87 Difference]: Start difference. First operand 868 states and 1329 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:21,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:21,154 INFO L93 Difference]: Finished difference Result 1710 states and 2622 transitions. [2025-03-08 00:59:21,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:21,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2025-03-08 00:59:21,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:21,157 INFO L225 Difference]: With dead ends: 1710 [2025-03-08 00:59:21,157 INFO L226 Difference]: Without dead ends: 844 [2025-03-08 00:59:21,158 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-08 00:59:21,159 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 329 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:21,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:59:21,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2025-03-08 00:59:21,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 844. [2025-03-08 00:59:21,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 843 states have (on average 1.4768683274021353) internal successors, (1245), 843 states have internal predecessors, (1245), 0 states have call successors, (0), 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-08 00:59:21,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1245 transitions. [2025-03-08 00:59:21,172 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1245 transitions. Word has length 199 [2025-03-08 00:59:21,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:21,173 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1245 transitions. [2025-03-08 00:59:21,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:21,173 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1245 transitions. [2025-03-08 00:59:21,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-08 00:59:21,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:21,175 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-08 00:59:21,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:59:21,175 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:21,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:21,175 INFO L85 PathProgramCache]: Analyzing trace with hash -604232579, now seen corresponding path program 1 times [2025-03-08 00:59:21,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:21,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248230369] [2025-03-08 00:59:21,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:21,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:21,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 00:59:21,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 00:59:21,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:21,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:59:21,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:21,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248230369] [2025-03-08 00:59:21,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248230369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:21,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:21,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:59:21,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796570802] [2025-03-08 00:59:21,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:21,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:21,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:21,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:21,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:21,396 INFO L87 Difference]: Start difference. First operand 844 states and 1245 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 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-08 00:59:21,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:21,999 INFO L93 Difference]: Finished difference Result 2498 states and 3690 transitions. [2025-03-08 00:59:21,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:21,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 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 200 [2025-03-08 00:59:22,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:22,004 INFO L225 Difference]: With dead ends: 2498 [2025-03-08 00:59:22,004 INFO L226 Difference]: Without dead ends: 1656 [2025-03-08 00:59:22,005 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-08 00:59:22,007 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 207 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:22,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 144 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:59:22,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2025-03-08 00:59:22,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1656. [2025-03-08 00:59:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1655 states have (on average 1.3063444108761328) internal successors, (2162), 1655 states have internal predecessors, (2162), 0 states have call successors, (0), 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-08 00:59:22,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2162 transitions. [2025-03-08 00:59:22,034 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2162 transitions. Word has length 200 [2025-03-08 00:59:22,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:22,035 INFO L471 AbstractCegarLoop]: Abstraction has 1656 states and 2162 transitions. [2025-03-08 00:59:22,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 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-08 00:59:22,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2162 transitions. [2025-03-08 00:59:22,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 00:59:22,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:22,039 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:59:22,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:59:22,039 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:22,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:22,040 INFO L85 PathProgramCache]: Analyzing trace with hash 372309154, now seen corresponding path program 1 times [2025-03-08 00:59:22,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:22,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064133209] [2025-03-08 00:59:22,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:22,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:22,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 00:59:22,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 00:59:22,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:22,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:59:22,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:22,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064133209] [2025-03-08 00:59:22,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064133209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:59:22,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969762901] [2025-03-08 00:59:22,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:22,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:59:22,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:59:22,300 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-08 00:59:22,302 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-08 00:59:22,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 00:59:22,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 00:59:22,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:22,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:22,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:59:22,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:59:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:59:22,508 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:59:22,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969762901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:22,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:59:22,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-08 00:59:22,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827381290] [2025-03-08 00:59:22,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:22,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:22,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:22,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:22,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:59:22,510 INFO L87 Difference]: Start difference. First operand 1656 states and 2162 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:22,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:22,730 INFO L93 Difference]: Finished difference Result 4961 states and 6479 transitions. [2025-03-08 00:59:22,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:22,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-03-08 00:59:22,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:22,740 INFO L225 Difference]: With dead ends: 4961 [2025-03-08 00:59:22,741 INFO L226 Difference]: Without dead ends: 3307 [2025-03-08 00:59:22,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 205 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-08 00:59:22,744 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 321 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:22,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 539 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:59:22,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3307 states. [2025-03-08 00:59:22,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3307 to 3303. [2025-03-08 00:59:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3303 states, 3302 states have (on average 1.3058752271350698) internal successors, (4312), 3302 states have internal predecessors, (4312), 0 states have call successors, (0), 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-08 00:59:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 3303 states and 4312 transitions. [2025-03-08 00:59:22,799 INFO L78 Accepts]: Start accepts. Automaton has 3303 states and 4312 transitions. Word has length 206 [2025-03-08 00:59:22,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:22,799 INFO L471 AbstractCegarLoop]: Abstraction has 3303 states and 4312 transitions. [2025-03-08 00:59:22,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:22,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 4312 transitions. [2025-03-08 00:59:22,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 00:59:22,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:22,807 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2025-03-08 00:59:22,814 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-08 00:59:23,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:59:23,009 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:23,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:23,010 INFO L85 PathProgramCache]: Analyzing trace with hash -490232491, now seen corresponding path program 1 times [2025-03-08 00:59:23,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:23,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059842034] [2025-03-08 00:59:23,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:23,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:23,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 00:59:23,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 00:59:23,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:23,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:59:23,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:23,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059842034] [2025-03-08 00:59:23,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059842034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:23,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:23,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:59:23,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671888792] [2025-03-08 00:59:23,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:23,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:23,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:23,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:23,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:23,176 INFO L87 Difference]: Start difference. First operand 3303 states and 4312 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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-08 00:59:23,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:23,819 INFO L93 Difference]: Finished difference Result 9864 states and 12874 transitions. [2025-03-08 00:59:23,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:23,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 215 [2025-03-08 00:59:23,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:23,839 INFO L225 Difference]: With dead ends: 9864 [2025-03-08 00:59:23,839 INFO L226 Difference]: Without dead ends: 6563 [2025-03-08 00:59:23,844 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-08 00:59:23,846 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 245 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:23,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 328 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:59:23,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6563 states. [2025-03-08 00:59:23,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6563 to 6560. [2025-03-08 00:59:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6560 states, 6559 states have (on average 1.2308278701021498) internal successors, (8073), 6559 states have internal predecessors, (8073), 0 states have call successors, (0), 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-08 00:59:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6560 states to 6560 states and 8073 transitions. [2025-03-08 00:59:23,952 INFO L78 Accepts]: Start accepts. Automaton has 6560 states and 8073 transitions. Word has length 215 [2025-03-08 00:59:23,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:23,953 INFO L471 AbstractCegarLoop]: Abstraction has 6560 states and 8073 transitions. [2025-03-08 00:59:23,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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-08 00:59:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand 6560 states and 8073 transitions. [2025-03-08 00:59:23,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-08 00:59:23,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:23,962 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 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] [2025-03-08 00:59:23,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 00:59:23,962 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:23,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:23,963 INFO L85 PathProgramCache]: Analyzing trace with hash 22942294, now seen corresponding path program 1 times [2025-03-08 00:59:23,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:23,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768298364] [2025-03-08 00:59:23,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:23,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:24,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-08 00:59:24,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 00:59:24,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:24,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:59:24,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:24,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768298364] [2025-03-08 00:59:24,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768298364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:24,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:24,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:59:24,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570478459] [2025-03-08 00:59:24,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:24,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:59:24,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:24,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:59:24,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:59:24,196 INFO L87 Difference]: Start difference. First operand 6560 states and 8073 transitions. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:25,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:25,371 INFO L93 Difference]: Finished difference Result 26210 states and 32258 transitions. [2025-03-08 00:59:25,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:59:25,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 218 [2025-03-08 00:59:25,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:25,423 INFO L225 Difference]: With dead ends: 26210 [2025-03-08 00:59:25,423 INFO L226 Difference]: Without dead ends: 19652 [2025-03-08 00:59:25,433 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-08 00:59:25,433 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 889 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:25,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 66 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 00:59:25,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19652 states. [2025-03-08 00:59:25,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19652 to 19642. [2025-03-08 00:59:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19642 states, 19641 states have (on average 1.225752252940278) internal successors, (24075), 19641 states have internal predecessors, (24075), 0 states have call successors, (0), 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-08 00:59:25,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19642 states to 19642 states and 24075 transitions. [2025-03-08 00:59:25,787 INFO L78 Accepts]: Start accepts. Automaton has 19642 states and 24075 transitions. Word has length 218 [2025-03-08 00:59:25,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:25,788 INFO L471 AbstractCegarLoop]: Abstraction has 19642 states and 24075 transitions. [2025-03-08 00:59:25,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:25,788 INFO L276 IsEmpty]: Start isEmpty. Operand 19642 states and 24075 transitions. [2025-03-08 00:59:25,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-08 00:59:25,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:25,801 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:59:25,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 00:59:25,802 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:25,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:25,802 INFO L85 PathProgramCache]: Analyzing trace with hash 572581589, now seen corresponding path program 1 times [2025-03-08 00:59:25,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:25,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982987860] [2025-03-08 00:59:25,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:25,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:25,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 00:59:25,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 00:59:25,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:25,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:59:26,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:26,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982987860] [2025-03-08 00:59:26,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982987860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:59:26,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119232340] [2025-03-08 00:59:26,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:26,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:59:26,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:59:26,637 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:59:26,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:59:26,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 00:59:26,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 00:59:26,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:26,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:26,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:59:26,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:59:27,035 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:59:27,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:59:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:59:27,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119232340] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:59:27,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:59:27,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2025-03-08 00:59:27,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048603692] [2025-03-08 00:59:27,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:59:27,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:59:27,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:27,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:59:27,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:59:27,254 INFO L87 Difference]: Start difference. First operand 19642 states and 24075 transitions. Second operand has 7 states, 7 states have (on average 63.142857142857146) internal successors, (442), 6 states have internal predecessors, (442), 0 states have call successors, (0), 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-08 00:59:29,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:29,374 INFO L93 Difference]: Finished difference Result 63829 states and 78597 transitions. [2025-03-08 00:59:29,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:59:29,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 63.142857142857146) internal successors, (442), 6 states have internal predecessors, (442), 0 states have call successors, (0), 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 224 [2025-03-08 00:59:29,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:29,451 INFO L225 Difference]: With dead ends: 63829 [2025-03-08 00:59:29,451 INFO L226 Difference]: Without dead ends: 44189 [2025-03-08 00:59:29,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:59:29,476 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1957 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 2152 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1957 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 2152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:29,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1957 Valid, 155 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 2152 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 00:59:29,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44189 states. [2025-03-08 00:59:29,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44189 to 39853. [2025-03-08 00:59:30,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39853 states, 39852 states have (on average 1.2217956438823647) internal successors, (48691), 39852 states have internal predecessors, (48691), 0 states have call successors, (0), 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-08 00:59:30,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39853 states to 39853 states and 48691 transitions. [2025-03-08 00:59:30,261 INFO L78 Accepts]: Start accepts. Automaton has 39853 states and 48691 transitions. Word has length 224 [2025-03-08 00:59:30,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:30,262 INFO L471 AbstractCegarLoop]: Abstraction has 39853 states and 48691 transitions. [2025-03-08 00:59:30,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 63.142857142857146) internal successors, (442), 6 states have internal predecessors, (442), 0 states have call successors, (0), 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-08 00:59:30,263 INFO L276 IsEmpty]: Start isEmpty. Operand 39853 states and 48691 transitions. [2025-03-08 00:59:30,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 00:59:30,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:30,276 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2025-03-08 00:59:30,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 00:59:30,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-08 00:59:30,477 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:30,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:30,478 INFO L85 PathProgramCache]: Analyzing trace with hash -523486490, now seen corresponding path program 1 times [2025-03-08 00:59:30,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:30,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877774594] [2025-03-08 00:59:30,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:30,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:30,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 00:59:30,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 00:59:30,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:30,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 00:59:30,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:30,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877774594] [2025-03-08 00:59:30,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877774594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:30,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:30,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:59:30,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428928691] [2025-03-08 00:59:30,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:30,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:59:30,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:30,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:59:30,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:59:30,655 INFO L87 Difference]: Start difference. First operand 39853 states and 48691 transitions. Second operand has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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-08 00:59:31,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:31,477 INFO L93 Difference]: Finished difference Result 79092 states and 96717 transitions. [2025-03-08 00:59:31,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:59:31,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2025-03-08 00:59:31,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:31,550 INFO L225 Difference]: With dead ends: 79092 [2025-03-08 00:59:31,550 INFO L226 Difference]: Without dead ends: 39850 [2025-03-08 00:59:31,571 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-08 00:59:31,572 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 621 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:31,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 55 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:59:31,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39850 states. [2025-03-08 00:59:32,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39850 to 39850. [2025-03-08 00:59:32,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39850 states, 39849 states have (on average 1.2145850585962006) internal successors, (48400), 39849 states have internal predecessors, (48400), 0 states have call successors, (0), 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-08 00:59:32,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39850 states to 39850 states and 48400 transitions. [2025-03-08 00:59:32,091 INFO L78 Accepts]: Start accepts. Automaton has 39850 states and 48400 transitions. Word has length 225 [2025-03-08 00:59:32,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:32,091 INFO L471 AbstractCegarLoop]: Abstraction has 39850 states and 48400 transitions. [2025-03-08 00:59:32,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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-08 00:59:32,091 INFO L276 IsEmpty]: Start isEmpty. Operand 39850 states and 48400 transitions. [2025-03-08 00:59:32,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-08 00:59:32,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:32,107 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:59:32,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 00:59:32,107 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:32,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:32,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1781002732, now seen corresponding path program 1 times [2025-03-08 00:59:32,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:32,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825486956] [2025-03-08 00:59:32,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:32,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:32,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-08 00:59:32,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-08 00:59:32,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:32,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:59:32,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:32,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825486956] [2025-03-08 00:59:32,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825486956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:32,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:32,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:59:32,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775725412] [2025-03-08 00:59:32,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:32,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:32,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:32,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:32,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:32,254 INFO L87 Difference]: Start difference. First operand 39850 states and 48400 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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-08 00:59:33,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:33,334 INFO L93 Difference]: Finished difference Result 97783 states and 121216 transitions. [2025-03-08 00:59:33,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:33,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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 227 [2025-03-08 00:59:33,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:33,438 INFO L225 Difference]: With dead ends: 97783 [2025-03-08 00:59:33,438 INFO L226 Difference]: Without dead ends: 58544 [2025-03-08 00:59:33,475 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-08 00:59:33,475 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 193 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:33,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 364 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 00:59:33,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58544 states. [2025-03-08 00:59:34,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58544 to 57308. [2025-03-08 00:59:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57308 states, 57307 states have (on average 1.1739578062016855) internal successors, (67276), 57307 states have internal predecessors, (67276), 0 states have call successors, (0), 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-08 00:59:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57308 states to 57308 states and 67276 transitions. [2025-03-08 00:59:34,303 INFO L78 Accepts]: Start accepts. Automaton has 57308 states and 67276 transitions. Word has length 227 [2025-03-08 00:59:34,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:34,303 INFO L471 AbstractCegarLoop]: Abstraction has 57308 states and 67276 transitions. [2025-03-08 00:59:34,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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-08 00:59:34,303 INFO L276 IsEmpty]: Start isEmpty. Operand 57308 states and 67276 transitions. [2025-03-08 00:59:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-08 00:59:34,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:34,315 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 00:59:34,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 00:59:34,316 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:34,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:34,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1665738772, now seen corresponding path program 1 times [2025-03-08 00:59:34,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:34,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724880269] [2025-03-08 00:59:34,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:34,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:34,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-08 00:59:34,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-08 00:59:34,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:34,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:34,582 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:59:34,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:34,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724880269] [2025-03-08 00:59:34,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724880269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:34,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:34,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:59:34,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231271667] [2025-03-08 00:59:34,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:34,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:34,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:34,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:34,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:34,584 INFO L87 Difference]: Start difference. First operand 57308 states and 67276 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:35,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:35,420 INFO L93 Difference]: Finished difference Result 163201 states and 191500 transitions. [2025-03-08 00:59:35,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:35,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2025-03-08 00:59:35,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:35,583 INFO L225 Difference]: With dead ends: 163201 [2025-03-08 00:59:35,583 INFO L226 Difference]: Without dead ends: 106504 [2025-03-08 00:59:35,642 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-08 00:59:35,643 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 163 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:35,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 166 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:59:35,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106504 states. [2025-03-08 00:59:36,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106504 to 105674. [2025-03-08 00:59:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105674 states, 105673 states have (on average 1.1542210403792832) internal successors, (121970), 105673 states have internal predecessors, (121970), 0 states have call successors, (0), 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-08 00:59:37,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105674 states to 105674 states and 121970 transitions. [2025-03-08 00:59:37,103 INFO L78 Accepts]: Start accepts. Automaton has 105674 states and 121970 transitions. Word has length 264 [2025-03-08 00:59:37,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:37,103 INFO L471 AbstractCegarLoop]: Abstraction has 105674 states and 121970 transitions. [2025-03-08 00:59:37,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:37,104 INFO L276 IsEmpty]: Start isEmpty. Operand 105674 states and 121970 transitions. [2025-03-08 00:59:37,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-08 00:59:37,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:37,137 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 00:59:37,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 00:59:37,138 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:37,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:37,138 INFO L85 PathProgramCache]: Analyzing trace with hash -757991064, now seen corresponding path program 1 times [2025-03-08 00:59:37,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:37,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220976866] [2025-03-08 00:59:37,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:37,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:37,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-08 00:59:37,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-08 00:59:37,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:37,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:37,415 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-08 00:59:37,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:37,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220976866] [2025-03-08 00:59:37,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220976866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:37,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:37,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:59:37,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63463292] [2025-03-08 00:59:37,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:37,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:37,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:37,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:37,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:37,417 INFO L87 Difference]: Start difference. First operand 105674 states and 121970 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:38,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:38,601 INFO L93 Difference]: Finished difference Result 264877 states and 305208 transitions. [2025-03-08 00:59:38,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:38,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 298 [2025-03-08 00:59:38,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:39,017 INFO L225 Difference]: With dead ends: 264877 [2025-03-08 00:59:39,017 INFO L226 Difference]: Without dead ends: 160423 [2025-03-08 00:59:39,075 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-08 00:59:39,076 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 205 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:39,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 93 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:59:39,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160423 states. [2025-03-08 00:59:40,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160423 to 160411. [2025-03-08 00:59:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160411 states, 160410 states have (on average 1.1484882488622903) internal successors, (184229), 160410 states have internal predecessors, (184229), 0 states have call successors, (0), 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-08 00:59:41,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160411 states to 160411 states and 184229 transitions. [2025-03-08 00:59:41,094 INFO L78 Accepts]: Start accepts. Automaton has 160411 states and 184229 transitions. Word has length 298 [2025-03-08 00:59:41,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:41,094 INFO L471 AbstractCegarLoop]: Abstraction has 160411 states and 184229 transitions. [2025-03-08 00:59:41,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:41,094 INFO L276 IsEmpty]: Start isEmpty. Operand 160411 states and 184229 transitions. [2025-03-08 00:59:41,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-08 00:59:41,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:41,126 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:59:41,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 00:59:41,126 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:41,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:41,126 INFO L85 PathProgramCache]: Analyzing trace with hash 618957037, now seen corresponding path program 1 times [2025-03-08 00:59:41,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:41,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83504858] [2025-03-08 00:59:41,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:41,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:41,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-08 00:59:41,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-08 00:59:41,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:41,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:41,643 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-08 00:59:41,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:41,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83504858] [2025-03-08 00:59:41,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83504858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:59:41,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605083309] [2025-03-08 00:59:41,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:41,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:59:41,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:59:41,649 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:59:41,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:59:41,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-08 00:59:41,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-08 00:59:41,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:41,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:41,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:59:41,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:59:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-08 00:59:42,089 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:59:42,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605083309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:42,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:59:42,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-08 00:59:42,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805718728] [2025-03-08 00:59:42,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:42,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:42,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:42,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:42,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:59:42,090 INFO L87 Difference]: Start difference. First operand 160411 states and 184229 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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-08 00:59:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:43,153 INFO L93 Difference]: Finished difference Result 320614 states and 368235 transitions. [2025-03-08 00:59:43,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:43,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 305 [2025-03-08 00:59:43,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:43,371 INFO L225 Difference]: With dead ends: 320614 [2025-03-08 00:59:43,371 INFO L226 Difference]: Without dead ends: 160205 [2025-03-08 00:59:43,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 304 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-08 00:59:43,479 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 65 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:43,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 98 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:59:43,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160205 states. [2025-03-08 00:59:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160205 to 160205. [2025-03-08 00:59:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160205 states, 160204 states have (on average 1.1271191730543557) internal successors, (180569), 160204 states have internal predecessors, (180569), 0 states have call successors, (0), 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-08 00:59:45,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160205 states to 160205 states and 180569 transitions. [2025-03-08 00:59:45,818 INFO L78 Accepts]: Start accepts. Automaton has 160205 states and 180569 transitions. Word has length 305 [2025-03-08 00:59:45,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:45,819 INFO L471 AbstractCegarLoop]: Abstraction has 160205 states and 180569 transitions. [2025-03-08 00:59:45,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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-08 00:59:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 160205 states and 180569 transitions. [2025-03-08 00:59:45,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-08 00:59:45,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:45,861 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 00:59:45,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 00:59:46,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:59:46,062 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:46,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:46,063 INFO L85 PathProgramCache]: Analyzing trace with hash -508232194, now seen corresponding path program 1 times [2025-03-08 00:59:46,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:46,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492932105] [2025-03-08 00:59:46,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:46,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:46,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-08 00:59:46,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-08 00:59:46,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:46,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:46,477 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 00:59:46,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:46,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492932105] [2025-03-08 00:59:46,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492932105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:46,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:46,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:59:46,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417187176] [2025-03-08 00:59:46,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:46,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:46,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:46,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:46,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:46,478 INFO L87 Difference]: Start difference. First operand 160205 states and 180569 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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-08 00:59:47,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:47,992 INFO L93 Difference]: Finished difference Result 408833 states and 461420 transitions. [2025-03-08 00:59:47,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:47,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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 354 [2025-03-08 00:59:47,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:48,361 INFO L225 Difference]: With dead ends: 408833 [2025-03-08 00:59:48,361 INFO L226 Difference]: Without dead ends: 248630 [2025-03-08 00:59:48,468 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-08 00:59:48,468 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 226 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:48,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 328 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:59:48,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248630 states. [2025-03-08 00:59:51,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248630 to 248510. [2025-03-08 00:59:51,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248510 states, 248509 states have (on average 1.1156215670257414) internal successors, (277242), 248509 states have internal predecessors, (277242), 0 states have call successors, (0), 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-08 00:59:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248510 states to 248510 states and 277242 transitions. [2025-03-08 00:59:51,800 INFO L78 Accepts]: Start accepts. Automaton has 248510 states and 277242 transitions. Word has length 354 [2025-03-08 00:59:51,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:51,800 INFO L471 AbstractCegarLoop]: Abstraction has 248510 states and 277242 transitions. [2025-03-08 00:59:51,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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-08 00:59:51,800 INFO L276 IsEmpty]: Start isEmpty. Operand 248510 states and 277242 transitions. [2025-03-08 00:59:51,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-08 00:59:51,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:51,871 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:59:51,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 00:59:51,871 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:51,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:51,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1355772378, now seen corresponding path program 1 times [2025-03-08 00:59:51,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:51,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071412111] [2025-03-08 00:59:51,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:51,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:51,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-08 00:59:51,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-08 00:59:51,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:51,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:52,406 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 00:59:52,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:52,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071412111] [2025-03-08 00:59:52,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071412111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:52,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:52,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:59:52,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515326912] [2025-03-08 00:59:52,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:52,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:52,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:52,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:52,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:52,408 INFO L87 Difference]: Start difference. First operand 248510 states and 277242 transitions. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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-08 00:59:54,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:54,090 INFO L93 Difference]: Finished difference Result 482792 states and 538302 transitions. [2025-03-08 00:59:54,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:54,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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 375 [2025-03-08 00:59:54,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:54,433 INFO L225 Difference]: With dead ends: 482792 [2025-03-08 00:59:54,433 INFO L226 Difference]: Without dead ends: 234284 [2025-03-08 00:59:54,568 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-08 00:59:54,569 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 225 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:54,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 301 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:59:54,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234284 states. [2025-03-08 00:59:57,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234284 to 219632. [2025-03-08 00:59:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219632 states, 219631 states have (on average 1.094139716160287) internal successors, (240307), 219631 states have internal predecessors, (240307), 0 states have call successors, (0), 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-08 00:59:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219632 states to 219632 states and 240307 transitions. [2025-03-08 00:59:57,837 INFO L78 Accepts]: Start accepts. Automaton has 219632 states and 240307 transitions. Word has length 375 [2025-03-08 00:59:57,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:57,838 INFO L471 AbstractCegarLoop]: Abstraction has 219632 states and 240307 transitions. [2025-03-08 00:59:57,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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-08 00:59:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 219632 states and 240307 transitions. [2025-03-08 00:59:57,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-03-08 00:59:57,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:57,895 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:59:57,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 00:59:57,895 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:57,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:57,896 INFO L85 PathProgramCache]: Analyzing trace with hash 46741616, now seen corresponding path program 1 times [2025-03-08 00:59:57,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:57,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833418527] [2025-03-08 00:59:57,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:57,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:57,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-03-08 00:59:57,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-03-08 00:59:57,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:57,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 00:59:58,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:58,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833418527] [2025-03-08 00:59:58,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833418527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:58,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:58,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:59:58,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172530807] [2025-03-08 00:59:58,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:58,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:58,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:58,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:58,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:58,515 INFO L87 Difference]: Start difference. First operand 219632 states and 240307 transitions. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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-08 01:00:00,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:00:00,099 INFO L93 Difference]: Finished difference Result 459858 states and 502843 transitions. [2025-03-08 01:00:00,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:00:00,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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 388 [2025-03-08 01:00:00,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:00:00,413 INFO L225 Difference]: With dead ends: 459858 [2025-03-08 01:00:00,413 INFO L226 Difference]: Without dead ends: 241243 [2025-03-08 01:00:00,532 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-08 01:00:00,533 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 187 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:00:00,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 327 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:00:00,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241243 states. [2025-03-08 01:00:03,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241243 to 234651. [2025-03-08 01:00:03,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234651 states, 234650 states have (on average 1.08889835925847) internal successors, (255510), 234650 states have internal predecessors, (255510), 0 states have call successors, (0), 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-08 01:00:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234651 states to 234651 states and 255510 transitions. [2025-03-08 01:00:04,636 INFO L78 Accepts]: Start accepts. Automaton has 234651 states and 255510 transitions. Word has length 388 [2025-03-08 01:00:04,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:00:04,636 INFO L471 AbstractCegarLoop]: Abstraction has 234651 states and 255510 transitions. [2025-03-08 01:00:04,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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-08 01:00:04,637 INFO L276 IsEmpty]: Start isEmpty. Operand 234651 states and 255510 transitions. [2025-03-08 01:00:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-03-08 01:00:04,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:00:04,690 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:00:04,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 01:00:04,690 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:00:04,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:00:04,690 INFO L85 PathProgramCache]: Analyzing trace with hash -418972944, now seen corresponding path program 1 times [2025-03-08 01:00:04,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:00:04,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646337815] [2025-03-08 01:00:04,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:00:04,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:00:04,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-03-08 01:00:04,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-03-08 01:00:04,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:00:04,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:00:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-03-08 01:00:04,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:00:04,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646337815] [2025-03-08 01:00:04,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646337815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:00:04,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:00:04,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:00:04,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790740466] [2025-03-08 01:00:04,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:00:04,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:00:04,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:00:04,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:00:04,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:00:04,864 INFO L87 Difference]: Start difference. First operand 234651 states and 255510 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)