./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.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/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.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 2d5a83ebadca07865f87524ca234843199e1b35abf1f6d3ef3a25954ede1db9e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:59:43,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:59:43,464 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:59:43,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:59:43,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:59:43,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:59:43,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:59:43,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:59:43,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:59:43,492 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:59:43,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:59:43,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:59:43,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:59:43,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:59:43,494 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:59:43,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:59:43,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:59:43,494 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:59:43,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:59:43,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:59:43,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:59:43,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:59:43,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:59:43,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:59:43,495 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:59:43,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:59:43,495 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:59:43,495 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:59:43,495 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:59:43,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:59:43,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:59:43,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:59:43,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:59:43,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:59:43,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:59:43,496 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:59:43,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:59:43,496 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:59:43,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:59:43,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:59:43,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:59:43,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:59:43,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:59:43,497 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 -> 2d5a83ebadca07865f87524ca234843199e1b35abf1f6d3ef3a25954ede1db9e [2025-03-08 05:59:43,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:59:43,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:59:43,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:59:43,716 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:59:43,716 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:59:43,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c [2025-03-08 05:59:44,833 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd629bd2e/00445b1f54b5453d9f62055c90e4ecbb/FLAGd4f3eb0b0 [2025-03-08 05:59:45,095 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:59:45,100 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c [2025-03-08 05:59:45,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd629bd2e/00445b1f54b5453d9f62055c90e4ecbb/FLAGd4f3eb0b0 [2025-03-08 05:59:45,126 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd629bd2e/00445b1f54b5453d9f62055c90e4ecbb [2025-03-08 05:59:45,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:59:45,129 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:59:45,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:59:45,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:59:45,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:59:45,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:59:45" (1/1) ... [2025-03-08 05:59:45,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72be87ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:45, skipping insertion in model container [2025-03-08 05:59:45,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:59:45" (1/1) ... [2025-03-08 05:59:45,158 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:59:45,311 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/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c[12792,12805] [2025-03-08 05:59:45,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:59:45,320 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:59:45,364 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/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c[12792,12805] [2025-03-08 05:59:45,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:59:45,378 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:59:45,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:45 WrapperNode [2025-03-08 05:59:45,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:59:45,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:59:45,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:59:45,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:59:45,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:45" (1/1) ... [2025-03-08 05:59:45,393 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:45" (1/1) ... [2025-03-08 05:59:45,419 INFO L138 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 383 [2025-03-08 05:59:45,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:59:45,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:59:45,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:59:45,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:59:45,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:45" (1/1) ... [2025-03-08 05:59:45,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:45" (1/1) ... [2025-03-08 05:59:45,437 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:45" (1/1) ... [2025-03-08 05:59:45,451 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 05:59:45,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:45" (1/1) ... [2025-03-08 05:59:45,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:45" (1/1) ... [2025-03-08 05:59:45,465 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:45" (1/1) ... [2025-03-08 05:59:45,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:45" (1/1) ... [2025-03-08 05:59:45,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:45" (1/1) ... [2025-03-08 05:59:45,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:45" (1/1) ... [2025-03-08 05:59:45,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:59:45,477 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:59:45,478 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:59:45,478 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:59:45,478 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:45" (1/1) ... [2025-03-08 05:59:45,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:59:45,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:59:45,503 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 05:59:45,508 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 05:59:45,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:59:45,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:59:45,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:59:45,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:59:45,600 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:59:45,601 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:59:45,956 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-03-08 05:59:45,957 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:59:45,967 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:59:45,967 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:59:45,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:59:45 BoogieIcfgContainer [2025-03-08 05:59:45,968 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:59:45,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:59:45,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:59:45,973 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:59:45,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:59:45" (1/3) ... [2025-03-08 05:59:45,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6417bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:59:45, skipping insertion in model container [2025-03-08 05:59:45,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:45" (2/3) ... [2025-03-08 05:59:45,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6417bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:59:45, skipping insertion in model container [2025-03-08 05:59:45,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:59:45" (3/3) ... [2025-03-08 05:59:45,974 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c [2025-03-08 05:59:45,984 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:59:45,985 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c that has 1 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:59:46,028 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:59:46,037 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;@650ce8a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:59:46,037 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:59:46,042 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 99 states have (on average 1.7474747474747474) internal successors, (173), 100 states have internal predecessors, (173), 0 states have call successors, (0), 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 05:59:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 05:59:46,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:46,047 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] [2025-03-08 05:59:46,047 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:46,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:46,050 INFO L85 PathProgramCache]: Analyzing trace with hash 269631863, now seen corresponding path program 1 times [2025-03-08 05:59:46,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:46,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031829194] [2025-03-08 05:59:46,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:46,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:46,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 05:59:46,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 05:59:46,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:46,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:46,266 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 05:59:46,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:46,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031829194] [2025-03-08 05:59:46,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031829194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:46,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:46,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 05:59:46,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985979572] [2025-03-08 05:59:46,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:46,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 05:59:46,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:46,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 05:59:46,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:59:46,285 INFO L87 Difference]: Start difference. First operand has 101 states, 99 states have (on average 1.7474747474747474) internal successors, (173), 100 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 05:59:46,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:46,297 INFO L93 Difference]: Finished difference Result 165 states and 276 transitions. [2025-03-08 05:59:46,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 05:59:46,298 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-03-08 05:59:46,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:46,305 INFO L225 Difference]: With dead ends: 165 [2025-03-08 05:59:46,305 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 05:59:46,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:59:46,310 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:46,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:46,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 05:59:46,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-08 05:59:46,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.731958762886598) internal successors, (168), 97 states have internal predecessors, (168), 0 states have call successors, (0), 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 05:59:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 168 transitions. [2025-03-08 05:59:46,335 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 168 transitions. Word has length 33 [2025-03-08 05:59:46,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:46,335 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 168 transitions. [2025-03-08 05:59:46,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 05:59:46,335 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 168 transitions. [2025-03-08 05:59:46,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 05:59:46,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:46,336 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] [2025-03-08 05:59:46,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:59:46,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:46,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:46,337 INFO L85 PathProgramCache]: Analyzing trace with hash 14895318, now seen corresponding path program 1 times [2025-03-08 05:59:46,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:46,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618668787] [2025-03-08 05:59:46,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:46,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:46,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 05:59:46,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 05:59:46,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:46,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:46,568 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 05:59:46,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:46,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618668787] [2025-03-08 05:59:46,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618668787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:46,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:46,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:59:46,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322790555] [2025-03-08 05:59:46,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:46,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:59:46,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:46,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:59:46,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:59:46,570 INFO L87 Difference]: Start difference. First operand 98 states and 168 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 05:59:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:46,643 INFO L93 Difference]: Finished difference Result 162 states and 270 transitions. [2025-03-08 05:59:46,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:59:46,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-03-08 05:59:46,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:46,644 INFO L225 Difference]: With dead ends: 162 [2025-03-08 05:59:46,644 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 05:59:46,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 05:59:46,645 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:46,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 627 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:59:46,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 05:59:46,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-08 05:59:46,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.402061855670103) internal successors, (136), 97 states have internal predecessors, (136), 0 states have call successors, (0), 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 05:59:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2025-03-08 05:59:46,650 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 33 [2025-03-08 05:59:46,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:46,650 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2025-03-08 05:59:46,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 05:59:46,650 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2025-03-08 05:59:46,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 05:59:46,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:46,651 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] [2025-03-08 05:59:46,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:59:46,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:46,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:46,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1549577733, now seen corresponding path program 1 times [2025-03-08 05:59:46,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:46,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414072377] [2025-03-08 05:59:46,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:46,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:46,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 05:59:46,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 05:59:46,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:46,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:46,768 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 05:59:46,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:46,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414072377] [2025-03-08 05:59:46,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414072377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:46,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:46,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:46,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77141394] [2025-03-08 05:59:46,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:46,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:46,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:46,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:46,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:46,786 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 05:59:46,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:46,813 INFO L93 Difference]: Finished difference Result 210 states and 318 transitions. [2025-03-08 05:59:46,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:46,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-08 05:59:46,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:46,816 INFO L225 Difference]: With dead ends: 210 [2025-03-08 05:59:46,816 INFO L226 Difference]: Without dead ends: 150 [2025-03-08 05:59:46,817 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 05:59:46,817 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 86 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:46,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 311 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:46,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-08 05:59:46,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2025-03-08 05:59:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.4829931972789117) internal successors, (218), 147 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 05:59:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 218 transitions. [2025-03-08 05:59:46,825 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 218 transitions. Word has length 64 [2025-03-08 05:59:46,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:46,826 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 218 transitions. [2025-03-08 05:59:46,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 05:59:46,826 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 218 transitions. [2025-03-08 05:59:46,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 05:59:46,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:46,827 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] [2025-03-08 05:59:46,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:59:46,827 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:46,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:46,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1332946226, now seen corresponding path program 1 times [2025-03-08 05:59:46,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:46,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893664157] [2025-03-08 05:59:46,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:46,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:46,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 05:59:46,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 05:59:46,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:46,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:46,910 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 05:59:46,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:46,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893664157] [2025-03-08 05:59:46,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893664157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:46,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:46,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:46,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803489445] [2025-03-08 05:59:46,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:46,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:46,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:46,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:46,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:46,911 INFO L87 Difference]: Start difference. First operand 148 states and 218 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 05:59:46,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:46,935 INFO L93 Difference]: Finished difference Result 352 states and 550 transitions. [2025-03-08 05:59:46,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:46,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-08 05:59:46,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:46,939 INFO L225 Difference]: With dead ends: 352 [2025-03-08 05:59:46,939 INFO L226 Difference]: Without dead ends: 242 [2025-03-08 05:59:46,939 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 05:59:46,939 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 82 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:46,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 308 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:46,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-08 05:59:46,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2025-03-08 05:59:46,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 1.5355648535564854) internal successors, (367), 239 states have internal predecessors, (367), 0 states have call successors, (0), 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 05:59:46,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 367 transitions. [2025-03-08 05:59:46,953 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 367 transitions. Word has length 64 [2025-03-08 05:59:46,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:46,953 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 367 transitions. [2025-03-08 05:59:46,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 05:59:46,953 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 367 transitions. [2025-03-08 05:59:46,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 05:59:46,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:46,954 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] [2025-03-08 05:59:46,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:59:46,954 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:46,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:46,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1519794911, now seen corresponding path program 1 times [2025-03-08 05:59:46,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:46,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751951045] [2025-03-08 05:59:46,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:46,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:46,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 05:59:46,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 05:59:46,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:46,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:47,024 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 05:59:47,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:47,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751951045] [2025-03-08 05:59:47,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751951045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:47,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:47,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:47,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794262272] [2025-03-08 05:59:47,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:47,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:47,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:47,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:47,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:47,026 INFO L87 Difference]: Start difference. First operand 240 states and 367 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 05:59:47,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:47,048 INFO L93 Difference]: Finished difference Result 612 states and 969 transitions. [2025-03-08 05:59:47,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:47,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-08 05:59:47,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:47,054 INFO L225 Difference]: With dead ends: 612 [2025-03-08 05:59:47,054 INFO L226 Difference]: Without dead ends: 410 [2025-03-08 05:59:47,054 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 05:59:47,055 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 78 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:47,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 305 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:47,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-08 05:59:47,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2025-03-08 05:59:47,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.5601965601965602) internal successors, (635), 407 states have internal predecessors, (635), 0 states have call successors, (0), 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 05:59:47,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 635 transitions. [2025-03-08 05:59:47,079 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 635 transitions. Word has length 64 [2025-03-08 05:59:47,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:47,079 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 635 transitions. [2025-03-08 05:59:47,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 05:59:47,079 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 635 transitions. [2025-03-08 05:59:47,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 05:59:47,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:47,080 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] [2025-03-08 05:59:47,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:59:47,081 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:47,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:47,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1708732172, now seen corresponding path program 1 times [2025-03-08 05:59:47,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:47,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652080554] [2025-03-08 05:59:47,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:47,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:47,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 05:59:47,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 05:59:47,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:47,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:47,259 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 05:59:47,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:47,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652080554] [2025-03-08 05:59:47,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652080554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:47,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:47,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:59:47,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185869166] [2025-03-08 05:59:47,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:47,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:59:47,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:47,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:59:47,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:59:47,263 INFO L87 Difference]: Start difference. First operand 408 states and 635 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 05:59:47,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:47,415 INFO L93 Difference]: Finished difference Result 2628 states and 4217 transitions. [2025-03-08 05:59:47,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:59:47,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-08 05:59:47,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:47,427 INFO L225 Difference]: With dead ends: 2628 [2025-03-08 05:59:47,427 INFO L226 Difference]: Without dead ends: 2258 [2025-03-08 05:59:47,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:59:47,429 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1357 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:47,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1357 Valid, 898 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:59:47,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2025-03-08 05:59:47,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 776. [2025-03-08 05:59:47,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 775 states have (on average 1.5677419354838709) internal successors, (1215), 775 states have internal predecessors, (1215), 0 states have call successors, (0), 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 05:59:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1215 transitions. [2025-03-08 05:59:47,473 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1215 transitions. Word has length 64 [2025-03-08 05:59:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:47,473 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1215 transitions. [2025-03-08 05:59:47,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 05:59:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1215 transitions. [2025-03-08 05:59:47,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 05:59:47,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:47,476 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] [2025-03-08 05:59:47,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:59:47,476 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:47,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:47,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1460703992, now seen corresponding path program 1 times [2025-03-08 05:59:47,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:47,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258289473] [2025-03-08 05:59:47,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:47,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:47,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 05:59:47,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 05:59:47,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:47,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:47,759 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 05:59:47,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:47,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258289473] [2025-03-08 05:59:47,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258289473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:47,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:47,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:59:47,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846009035] [2025-03-08 05:59:47,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:47,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:59:47,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:47,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:59:47,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:59:47,760 INFO L87 Difference]: Start difference. First operand 776 states and 1215 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 05:59:47,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:47,814 INFO L93 Difference]: Finished difference Result 826 states and 1280 transitions. [2025-03-08 05:59:47,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:59:47,814 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-08 05:59:47,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:47,818 INFO L225 Difference]: With dead ends: 826 [2025-03-08 05:59:47,818 INFO L226 Difference]: Without dead ends: 824 [2025-03-08 05:59:47,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:59:47,819 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:47,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 898 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:47,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-03-08 05:59:47,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2025-03-08 05:59:47,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 823 states have (on average 1.534629404617254) internal successors, (1263), 823 states have internal predecessors, (1263), 0 states have call successors, (0), 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 05:59:47,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1263 transitions. [2025-03-08 05:59:47,854 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1263 transitions. Word has length 65 [2025-03-08 05:59:47,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:47,854 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1263 transitions. [2025-03-08 05:59:47,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 05:59:47,854 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1263 transitions. [2025-03-08 05:59:47,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 05:59:47,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:47,855 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] [2025-03-08 05:59:47,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:59:47,855 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:47,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:47,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1874096948, now seen corresponding path program 1 times [2025-03-08 05:59:47,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:47,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499901283] [2025-03-08 05:59:47,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:47,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:47,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 05:59:47,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 05:59:47,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:47,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:47,920 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 05:59:47,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:47,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499901283] [2025-03-08 05:59:47,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499901283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:47,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:47,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:47,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375311596] [2025-03-08 05:59:47,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:47,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:47,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:47,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:47,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:47,921 INFO L87 Difference]: Start difference. First operand 824 states and 1263 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 05:59:47,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:47,953 INFO L93 Difference]: Finished difference Result 1978 states and 3063 transitions. [2025-03-08 05:59:47,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:47,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-03-08 05:59:47,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:47,958 INFO L225 Difference]: With dead ends: 1978 [2025-03-08 05:59:47,958 INFO L226 Difference]: Without dead ends: 1192 [2025-03-08 05:59:47,959 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 05:59:47,960 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 63 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:47,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 249 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:47,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2025-03-08 05:59:47,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1190. [2025-03-08 05:59:47,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1189 states have (on average 1.5382674516400336) internal successors, (1829), 1189 states have internal predecessors, (1829), 0 states have call successors, (0), 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 05:59:47,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1829 transitions. [2025-03-08 05:59:47,995 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1829 transitions. Word has length 66 [2025-03-08 05:59:47,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:47,995 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1829 transitions. [2025-03-08 05:59:47,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 05:59:47,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1829 transitions. [2025-03-08 05:59:47,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 05:59:47,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:47,998 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] [2025-03-08 05:59:47,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:59:47,998 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:47,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:47,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1226962939, now seen corresponding path program 1 times [2025-03-08 05:59:47,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:47,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405783808] [2025-03-08 05:59:47,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:47,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:48,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 05:59:48,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 05:59:48,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:48,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:48,058 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 05:59:48,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:48,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405783808] [2025-03-08 05:59:48,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405783808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:48,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:48,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:48,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620120967] [2025-03-08 05:59:48,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:48,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:48,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:48,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:48,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:48,060 INFO L87 Difference]: Start difference. First operand 1190 states and 1829 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 05:59:48,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:48,108 INFO L93 Difference]: Finished difference Result 3298 states and 5071 transitions. [2025-03-08 05:59:48,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:48,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-03-08 05:59:48,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:48,115 INFO L225 Difference]: With dead ends: 3298 [2025-03-08 05:59:48,115 INFO L226 Difference]: Without dead ends: 2148 [2025-03-08 05:59:48,119 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 05:59:48,120 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 70 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:48,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 289 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:48,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2025-03-08 05:59:48,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2146. [2025-03-08 05:59:48,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2146 states, 2145 states have (on average 1.5184149184149185) internal successors, (3257), 2145 states have internal predecessors, (3257), 0 states have call successors, (0), 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 05:59:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 3257 transitions. [2025-03-08 05:59:48,191 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 3257 transitions. Word has length 67 [2025-03-08 05:59:48,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:48,191 INFO L471 AbstractCegarLoop]: Abstraction has 2146 states and 3257 transitions. [2025-03-08 05:59:48,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 05:59:48,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 3257 transitions. [2025-03-08 05:59:48,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 05:59:48,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:48,192 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] [2025-03-08 05:59:48,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:59:48,192 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:48,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:48,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1909328467, now seen corresponding path program 1 times [2025-03-08 05:59:48,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:48,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890664706] [2025-03-08 05:59:48,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:48,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:48,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 05:59:48,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 05:59:48,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:48,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:48,245 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 05:59:48,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:48,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890664706] [2025-03-08 05:59:48,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890664706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:48,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:48,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:48,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653541755] [2025-03-08 05:59:48,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:48,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:48,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:48,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:48,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:48,247 INFO L87 Difference]: Start difference. First operand 2146 states and 3257 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 05:59:48,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:48,306 INFO L93 Difference]: Finished difference Result 5974 states and 9019 transitions. [2025-03-08 05:59:48,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:48,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-03-08 05:59:48,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:48,318 INFO L225 Difference]: With dead ends: 5974 [2025-03-08 05:59:48,319 INFO L226 Difference]: Without dead ends: 3868 [2025-03-08 05:59:48,321 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 05:59:48,321 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 74 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:48,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 302 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2025-03-08 05:59:48,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3866. [2025-03-08 05:59:48,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3866 states, 3865 states have (on average 1.4884864165588616) internal successors, (5753), 3865 states have internal predecessors, (5753), 0 states have call successors, (0), 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 05:59:48,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3866 states to 3866 states and 5753 transitions. [2025-03-08 05:59:48,411 INFO L78 Accepts]: Start accepts. Automaton has 3866 states and 5753 transitions. Word has length 67 [2025-03-08 05:59:48,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:48,412 INFO L471 AbstractCegarLoop]: Abstraction has 3866 states and 5753 transitions. [2025-03-08 05:59:48,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 05:59:48,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3866 states and 5753 transitions. [2025-03-08 05:59:48,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 05:59:48,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:48,417 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:59:48,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:59:48,419 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:48,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:48,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1414260545, now seen corresponding path program 1 times [2025-03-08 05:59:48,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:48,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830129335] [2025-03-08 05:59:48,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:48,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:48,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 05:59:48,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:59:48,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:48,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:48,513 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:48,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:48,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830129335] [2025-03-08 05:59:48,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830129335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:48,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:48,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:48,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933703326] [2025-03-08 05:59:48,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:48,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:48,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:48,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:48,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:48,515 INFO L87 Difference]: Start difference. First operand 3866 states and 5753 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 05:59:48,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:48,571 INFO L93 Difference]: Finished difference Result 7694 states and 11467 transitions. [2025-03-08 05:59:48,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:48,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-08 05:59:48,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:48,582 INFO L225 Difference]: With dead ends: 7694 [2025-03-08 05:59:48,582 INFO L226 Difference]: Without dead ends: 3868 [2025-03-08 05:59:48,586 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 05:59:48,587 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 67 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:48,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 294 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:48,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2025-03-08 05:59:48,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3866. [2025-03-08 05:59:48,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3866 states, 3865 states have (on average 1.4760672703751616) internal successors, (5705), 3865 states have internal predecessors, (5705), 0 states have call successors, (0), 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 05:59:48,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3866 states to 3866 states and 5705 transitions. [2025-03-08 05:59:48,701 INFO L78 Accepts]: Start accepts. Automaton has 3866 states and 5705 transitions. Word has length 93 [2025-03-08 05:59:48,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:48,701 INFO L471 AbstractCegarLoop]: Abstraction has 3866 states and 5705 transitions. [2025-03-08 05:59:48,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 05:59:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3866 states and 5705 transitions. [2025-03-08 05:59:48,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 05:59:48,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:48,703 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:59:48,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:59:48,703 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:48,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:48,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1713898158, now seen corresponding path program 1 times [2025-03-08 05:59:48,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:48,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689304726] [2025-03-08 05:59:48,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:48,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:48,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 05:59:48,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:59:48,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:48,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:48,775 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:48,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:48,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689304726] [2025-03-08 05:59:48,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689304726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:48,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:48,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:48,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151693009] [2025-03-08 05:59:48,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:48,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:48,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:48,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:48,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:48,776 INFO L87 Difference]: Start difference. First operand 3866 states and 5705 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 05:59:48,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:48,813 INFO L93 Difference]: Finished difference Result 5782 states and 8539 transitions. [2025-03-08 05:59:48,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:48,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-08 05:59:48,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:48,819 INFO L225 Difference]: With dead ends: 5782 [2025-03-08 05:59:48,819 INFO L226 Difference]: Without dead ends: 1956 [2025-03-08 05:59:48,822 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 05:59:48,822 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 61 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:48,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 275 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:48,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2025-03-08 05:59:48,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1954. [2025-03-08 05:59:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1953 states have (on average 1.4587813620071686) internal successors, (2849), 1953 states have internal predecessors, (2849), 0 states have call successors, (0), 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 05:59:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2849 transitions. [2025-03-08 05:59:48,858 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2849 transitions. Word has length 93 [2025-03-08 05:59:48,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:48,858 INFO L471 AbstractCegarLoop]: Abstraction has 1954 states and 2849 transitions. [2025-03-08 05:59:48,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 05:59:48,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2849 transitions. [2025-03-08 05:59:48,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 05:59:48,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:48,860 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:59:48,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:59:48,860 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:48,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:48,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1962091365, now seen corresponding path program 1 times [2025-03-08 05:59:48,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:48,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602688616] [2025-03-08 05:59:48,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:48,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:48,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 05:59:48,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:59:48,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:48,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:49,598 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:49,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:49,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602688616] [2025-03-08 05:59:49,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602688616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:59:49,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543907055] [2025-03-08 05:59:49,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:49,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:59:49,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:59:49,601 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 05:59:49,602 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 05:59:49,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 05:59:49,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:59:49,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:49,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:49,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 05:59:49,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:59:50,484 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:50,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:59:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:51,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543907055] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:59:51,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:59:51,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 26 [2025-03-08 05:59:51,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599260556] [2025-03-08 05:59:51,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:59:51,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 05:59:51,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:51,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 05:59:51,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2025-03-08 05:59:51,208 INFO L87 Difference]: Start difference. First operand 1954 states and 2849 transitions. Second operand has 26 states, 26 states have (on average 10.307692307692308) internal successors, (268), 26 states have internal predecessors, (268), 0 states have call successors, (0), 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 06:00:03,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:03,809 INFO L93 Difference]: Finished difference Result 25382 states and 36630 transitions. [2025-03-08 06:00:03,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2025-03-08 06:00:03,810 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.307692307692308) internal successors, (268), 26 states have internal predecessors, (268), 0 states have call successors, (0), 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 93 [2025-03-08 06:00:03,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:03,876 INFO L225 Difference]: With dead ends: 25382 [2025-03-08 06:00:03,877 INFO L226 Difference]: Without dead ends: 23468 [2025-03-08 06:00:03,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16493 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=5826, Invalid=35586, Unknown=0, NotChecked=0, Total=41412 [2025-03-08 06:00:03,891 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 13483 mSDsluCounter, 2625 mSDsCounter, 0 mSdLazyCounter, 2584 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13483 SdHoareTripleChecker+Valid, 2859 SdHoareTripleChecker+Invalid, 2839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 2584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:03,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13483 Valid, 2859 Invalid, 2839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 2584 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 06:00:03,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23468 states. [2025-03-08 06:00:04,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23468 to 11692. [2025-03-08 06:00:04,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11692 states, 11691 states have (on average 1.4387135403301685) internal successors, (16820), 11691 states have internal predecessors, (16820), 0 states have call successors, (0), 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 06:00:04,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11692 states to 11692 states and 16820 transitions. [2025-03-08 06:00:04,252 INFO L78 Accepts]: Start accepts. Automaton has 11692 states and 16820 transitions. Word has length 93 [2025-03-08 06:00:04,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:04,252 INFO L471 AbstractCegarLoop]: Abstraction has 11692 states and 16820 transitions. [2025-03-08 06:00:04,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.307692307692308) internal successors, (268), 26 states have internal predecessors, (268), 0 states have call successors, (0), 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 06:00:04,253 INFO L276 IsEmpty]: Start isEmpty. Operand 11692 states and 16820 transitions. [2025-03-08 06:00:04,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:00:04,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:04,255 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:00:04,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 06:00:04,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 06:00:04,457 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:04,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:04,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1147435407, now seen corresponding path program 1 times [2025-03-08 06:00:04,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:04,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833097123] [2025-03-08 06:00:04,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:04,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:04,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:00:04,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:00:04,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:04,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:04,594 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:00:04,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:04,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833097123] [2025-03-08 06:00:04,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833097123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:04,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:04,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:00:04,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660516940] [2025-03-08 06:00:04,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:04,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:00:04,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:04,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:00:04,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:00:04,595 INFO L87 Difference]: Start difference. First operand 11692 states and 16820 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 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 06:00:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:05,122 INFO L93 Difference]: Finished difference Result 41546 states and 60102 transitions. [2025-03-08 06:00:05,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:00:05,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:00:05,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:05,186 INFO L225 Difference]: With dead ends: 41546 [2025-03-08 06:00:05,186 INFO L226 Difference]: Without dead ends: 35528 [2025-03-08 06:00:05,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:00:05,196 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 773 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:05,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1275 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:00:05,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35528 states. [2025-03-08 06:00:05,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35528 to 17470. [2025-03-08 06:00:05,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17470 states, 17469 states have (on average 1.4345411872459786) internal successors, (25060), 17469 states have internal predecessors, (25060), 0 states have call successors, (0), 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 06:00:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17470 states to 17470 states and 25060 transitions. [2025-03-08 06:00:05,741 INFO L78 Accepts]: Start accepts. Automaton has 17470 states and 25060 transitions. Word has length 94 [2025-03-08 06:00:05,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:05,741 INFO L471 AbstractCegarLoop]: Abstraction has 17470 states and 25060 transitions. [2025-03-08 06:00:05,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 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 06:00:05,742 INFO L276 IsEmpty]: Start isEmpty. Operand 17470 states and 25060 transitions. [2025-03-08 06:00:05,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:00:05,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:05,743 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] [2025-03-08 06:00:05,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:00:05,744 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:05,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:05,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1921706088, now seen corresponding path program 1 times [2025-03-08 06:00:05,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:05,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552067430] [2025-03-08 06:00:05,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:05,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:05,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:00:05,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:00:05,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:05,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:05,870 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 06:00:05,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:05,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552067430] [2025-03-08 06:00:05,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552067430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:05,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:05,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:00:05,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95417363] [2025-03-08 06:00:05,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:05,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:00:05,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:05,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:00:05,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:00:05,873 INFO L87 Difference]: Start difference. First operand 17470 states and 25060 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 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 06:00:06,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:06,624 INFO L93 Difference]: Finished difference Result 47324 states and 68342 transitions. [2025-03-08 06:00:06,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:00:06,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:00:06,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:06,708 INFO L225 Difference]: With dead ends: 47324 [2025-03-08 06:00:06,708 INFO L226 Difference]: Without dead ends: 41306 [2025-03-08 06:00:06,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:00:06,720 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 775 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:06,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 1169 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:00:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41306 states. [2025-03-08 06:00:07,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41306 to 23248. [2025-03-08 06:00:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23248 states, 23247 states have (on average 1.43244289585753) internal successors, (33300), 23247 states have internal predecessors, (33300), 0 states have call successors, (0), 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 06:00:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23248 states to 23248 states and 33300 transitions. [2025-03-08 06:00:07,454 INFO L78 Accepts]: Start accepts. Automaton has 23248 states and 33300 transitions. Word has length 94 [2025-03-08 06:00:07,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:07,455 INFO L471 AbstractCegarLoop]: Abstraction has 23248 states and 33300 transitions. [2025-03-08 06:00:07,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 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 06:00:07,455 INFO L276 IsEmpty]: Start isEmpty. Operand 23248 states and 33300 transitions. [2025-03-08 06:00:07,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:00:07,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:07,457 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:00:07,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:00:07,457 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:07,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:07,458 INFO L85 PathProgramCache]: Analyzing trace with hash -368335641, now seen corresponding path program 1 times [2025-03-08 06:00:07,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:07,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855896730] [2025-03-08 06:00:07,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:07,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:07,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:00:07,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:00:07,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:07,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 06:00:07,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:07,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855896730] [2025-03-08 06:00:07,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855896730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:07,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:07,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:00:07,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036314925] [2025-03-08 06:00:07,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:07,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:00:07,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:07,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:00:07,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:00:07,648 INFO L87 Difference]: Start difference. First operand 23248 states and 33300 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 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 06:00:08,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:08,327 INFO L93 Difference]: Finished difference Result 53094 states and 76568 transitions. [2025-03-08 06:00:08,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:00:08,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:00:08,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:08,390 INFO L225 Difference]: With dead ends: 53094 [2025-03-08 06:00:08,390 INFO L226 Difference]: Without dead ends: 47076 [2025-03-08 06:00:08,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:00:08,398 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 821 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:08,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1134 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:00:08,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47076 states. [2025-03-08 06:00:09,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47076 to 29018. [2025-03-08 06:00:09,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29018 states, 29017 states have (on average 1.4310921184133438) internal successors, (41526), 29017 states have internal predecessors, (41526), 0 states have call successors, (0), 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 06:00:09,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29018 states to 29018 states and 41526 transitions. [2025-03-08 06:00:09,062 INFO L78 Accepts]: Start accepts. Automaton has 29018 states and 41526 transitions. Word has length 94 [2025-03-08 06:00:09,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:09,063 INFO L471 AbstractCegarLoop]: Abstraction has 29018 states and 41526 transitions. [2025-03-08 06:00:09,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 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 06:00:09,063 INFO L276 IsEmpty]: Start isEmpty. Operand 29018 states and 41526 transitions. [2025-03-08 06:00:09,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:00:09,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:09,064 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] [2025-03-08 06:00:09,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:00:09,064 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:09,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:09,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2051568570, now seen corresponding path program 1 times [2025-03-08 06:00:09,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:09,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18433667] [2025-03-08 06:00:09,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:09,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:09,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:00:09,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:00:09,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:09,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:09,164 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 06:00:09,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:09,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18433667] [2025-03-08 06:00:09,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18433667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:09,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:09,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:00:09,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706378293] [2025-03-08 06:00:09,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:09,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:00:09,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:09,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:00:09,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:00:09,166 INFO L87 Difference]: Start difference. First operand 29018 states and 41526 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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 06:00:10,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:10,070 INFO L93 Difference]: Finished difference Result 58864 states and 84794 transitions. [2025-03-08 06:00:10,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:00:10,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:00:10,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:10,134 INFO L225 Difference]: With dead ends: 58864 [2025-03-08 06:00:10,134 INFO L226 Difference]: Without dead ends: 52846 [2025-03-08 06:00:10,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:00:10,148 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 910 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:10,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 1117 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:00:10,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52846 states. [2025-03-08 06:00:11,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52846 to 34788. [2025-03-08 06:00:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34788 states, 34787 states have (on average 1.4301894385833789) internal successors, (49752), 34787 states have internal predecessors, (49752), 0 states have call successors, (0), 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 06:00:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34788 states to 34788 states and 49752 transitions. [2025-03-08 06:00:11,336 INFO L78 Accepts]: Start accepts. Automaton has 34788 states and 49752 transitions. Word has length 94 [2025-03-08 06:00:11,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:11,337 INFO L471 AbstractCegarLoop]: Abstraction has 34788 states and 49752 transitions. [2025-03-08 06:00:11,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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 06:00:11,337 INFO L276 IsEmpty]: Start isEmpty. Operand 34788 states and 49752 transitions. [2025-03-08 06:00:11,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:00:11,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:11,339 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] [2025-03-08 06:00:11,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:00:11,339 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:11,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:11,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1667016946, now seen corresponding path program 1 times [2025-03-08 06:00:11,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:11,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675320819] [2025-03-08 06:00:11,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:11,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:11,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:00:11,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:00:11,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:11,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 06:00:11,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:11,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675320819] [2025-03-08 06:00:11,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675320819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:11,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:11,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:00:11,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41139945] [2025-03-08 06:00:11,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:11,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:00:11,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:11,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:00:11,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:00:11,483 INFO L87 Difference]: Start difference. First operand 34788 states and 49752 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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 06:00:12,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:12,525 INFO L93 Difference]: Finished difference Result 64634 states and 93020 transitions. [2025-03-08 06:00:12,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:00:12,530 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:00:12,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:12,614 INFO L225 Difference]: With dead ends: 64634 [2025-03-08 06:00:12,614 INFO L226 Difference]: Without dead ends: 58616 [2025-03-08 06:00:12,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:00:12,637 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 803 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:12,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 1257 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:00:12,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58616 states. [2025-03-08 06:00:13,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58616 to 40558. [2025-03-08 06:00:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40558 states, 40557 states have (on average 1.4295436052962498) internal successors, (57978), 40557 states have internal predecessors, (57978), 0 states have call successors, (0), 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 06:00:13,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40558 states to 40558 states and 57978 transitions. [2025-03-08 06:00:13,709 INFO L78 Accepts]: Start accepts. Automaton has 40558 states and 57978 transitions. Word has length 94 [2025-03-08 06:00:13,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:13,709 INFO L471 AbstractCegarLoop]: Abstraction has 40558 states and 57978 transitions. [2025-03-08 06:00:13,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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 06:00:13,709 INFO L276 IsEmpty]: Start isEmpty. Operand 40558 states and 57978 transitions. [2025-03-08 06:00:13,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:00:13,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:13,711 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:00:13,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:00:13,711 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:13,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:13,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1785772625, now seen corresponding path program 1 times [2025-03-08 06:00:13,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:13,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128932312] [2025-03-08 06:00:13,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:13,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:13,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:00:13,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:00:13,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:13,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:14,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:14,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128932312] [2025-03-08 06:00:14,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128932312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:00:14,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171530660] [2025-03-08 06:00:14,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:14,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:00:14,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:00:14,085 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 06:00:14,087 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 06:00:14,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:00:14,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:00:14,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:14,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:14,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 06:00:14,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:00:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:14,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:00:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:15,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171530660] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:00:15,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:00:15,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 16] total 36 [2025-03-08 06:00:15,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522841665] [2025-03-08 06:00:15,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:00:15,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-08 06:00:15,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:15,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-08 06:00:15,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 06:00:15,785 INFO L87 Difference]: Start difference. First operand 40558 states and 57978 transitions. Second operand has 36 states, 36 states have (on average 7.333333333333333) internal successors, (264), 36 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 06:00:31,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:31,427 INFO L93 Difference]: Finished difference Result 662615 states and 949783 transitions. [2025-03-08 06:00:31,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2025-03-08 06:00:31,428 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 7.333333333333333) internal successors, (264), 36 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 97 [2025-03-08 06:00:31,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:32,724 INFO L225 Difference]: With dead ends: 662615 [2025-03-08 06:00:32,724 INFO L226 Difference]: Without dead ends: 622099 [2025-03-08 06:00:32,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15534 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=6646, Invalid=34766, Unknown=0, NotChecked=0, Total=41412 [2025-03-08 06:00:32,821 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 12663 mSDsluCounter, 3324 mSDsCounter, 0 mSdLazyCounter, 3661 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12663 SdHoareTripleChecker+Valid, 3492 SdHoareTripleChecker+Invalid, 3792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 3661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:32,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12663 Valid, 3492 Invalid, 3792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 3661 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 06:00:33,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622099 states. [2025-03-08 06:00:46,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622099 to 428853. [2025-03-08 06:00:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428853 states, 428852 states have (on average 1.4044285674311885) internal successors, (602292), 428852 states have internal predecessors, (602292), 0 states have call successors, (0), 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 06:00:48,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428853 states to 428853 states and 602292 transitions. [2025-03-08 06:00:48,342 INFO L78 Accepts]: Start accepts. Automaton has 428853 states and 602292 transitions. Word has length 97 [2025-03-08 06:00:48,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:48,342 INFO L471 AbstractCegarLoop]: Abstraction has 428853 states and 602292 transitions. [2025-03-08 06:00:48,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.333333333333333) internal successors, (264), 36 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 06:00:48,343 INFO L276 IsEmpty]: Start isEmpty. Operand 428853 states and 602292 transitions. [2025-03-08 06:00:48,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:00:48,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:48,356 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] [2025-03-08 06:00:48,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 06:00:48,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:00:48,557 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:48,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:48,557 INFO L85 PathProgramCache]: Analyzing trace with hash -371204728, now seen corresponding path program 1 times [2025-03-08 06:00:48,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:48,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986069753] [2025-03-08 06:00:48,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:48,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:48,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:00:48,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:00:48,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:48,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:48,629 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:48,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:48,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986069753] [2025-03-08 06:00:48,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986069753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:48,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:48,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:00:48,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106759985] [2025-03-08 06:00:48,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:48,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:00:48,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:48,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:00:48,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:00:48,631 INFO L87 Difference]: Start difference. First operand 428853 states and 602292 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)