./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.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.4_overflow.ufo.UNBOUNDED.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 8cf9a91c8f1111f4616406dfb4a7fdeef392d21e591ff8d6357140f3015668db --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:01:28,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:01:28,423 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:01:28,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:01:28,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:01:28,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:01:28,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:01:28,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:01:28,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:01:28,456 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:01:28,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:01:28,456 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:01:28,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:01:28,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:01:28,457 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:01:28,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:01:28,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:01:28,457 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:01:28,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:01:28,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:01:28,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:01:28,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:01:28,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:01:28,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:01:28,458 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:01:28,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:01:28,458 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:01:28,458 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:01:28,459 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:01:28,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:01:28,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:01:28,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:01:28,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:01:28,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:01:28,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:01:28,460 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:01:28,460 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:01:28,460 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:01:28,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:01:28,460 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:01:28,460 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:01:28,460 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:01:28,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:01:28,460 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 -> 8cf9a91c8f1111f4616406dfb4a7fdeef392d21e591ff8d6357140f3015668db [2025-03-08 06:01:28,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:01:28,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:01:28,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:01:28,745 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:01:28,745 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:01:28,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c [2025-03-08 06:01:30,004 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e5b8b033/4ab20f4ccf9c4a40a91cfcdb73dd1519/FLAG70c713411 [2025-03-08 06:01:30,332 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:01:30,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c [2025-03-08 06:01:30,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e5b8b033/4ab20f4ccf9c4a40a91cfcdb73dd1519/FLAG70c713411 [2025-03-08 06:01:30,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e5b8b033/4ab20f4ccf9c4a40a91cfcdb73dd1519 [2025-03-08 06:01:30,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:01:30,614 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:01:30,615 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:01:30,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:01:30,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:01:30,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:01:30" (1/1) ... [2025-03-08 06:01:30,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5803ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:30, skipping insertion in model container [2025-03-08 06:01:30,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:01:30" (1/1) ... [2025-03-08 06:01:30,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:01:30,841 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.4_overflow.ufo.UNBOUNDED.pals.c[8379,8392] [2025-03-08 06:01:30,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:01:30,857 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:01:30,894 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.4_overflow.ufo.UNBOUNDED.pals.c[8379,8392] [2025-03-08 06:01:30,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:01:30,908 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:01:30,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:30 WrapperNode [2025-03-08 06:01:30,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:01:30,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:01:30,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:01:30,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:01:30,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:30" (1/1) ... [2025-03-08 06:01:30,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:30" (1/1) ... [2025-03-08 06:01:30,946 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 273 [2025-03-08 06:01:30,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:01:30,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:01:30,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:01:30,948 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:01:30,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:30" (1/1) ... [2025-03-08 06:01:30,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:30" (1/1) ... [2025-03-08 06:01:30,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:30" (1/1) ... [2025-03-08 06:01:30,965 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 06:01:30,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:30" (1/1) ... [2025-03-08 06:01:30,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:30" (1/1) ... [2025-03-08 06:01:30,970 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:30" (1/1) ... [2025-03-08 06:01:30,971 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:30" (1/1) ... [2025-03-08 06:01:30,972 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:30" (1/1) ... [2025-03-08 06:01:30,975 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:30" (1/1) ... [2025-03-08 06:01:30,978 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:01:30,979 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:01:30,979 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:01:30,979 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:01:30,980 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:30" (1/1) ... [2025-03-08 06:01:30,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:01:31,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:01:31,025 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 06:01:31,029 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 06:01:31,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:01:31,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:01:31,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:01:31,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:01:31,130 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:01:31,132 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:01:31,417 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-08 06:01:31,417 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:01:31,426 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:01:31,426 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:01:31,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:01:31 BoogieIcfgContainer [2025-03-08 06:01:31,427 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:01:31,428 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:01:31,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:01:31,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:01:31,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:01:30" (1/3) ... [2025-03-08 06:01:31,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63982018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:01:31, skipping insertion in model container [2025-03-08 06:01:31,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:30" (2/3) ... [2025-03-08 06:01:31,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63982018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:01:31, skipping insertion in model container [2025-03-08 06:01:31,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:01:31" (3/3) ... [2025-03-08 06:01:31,435 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c [2025-03-08 06:01:31,446 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:01:31,447 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c that has 1 procedures, 68 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 06:01:31,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:01:31,502 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;@223100a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:01:31,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:01:31,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 66 states have (on average 1.7272727272727273) internal successors, (114), 67 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:31,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 06:01:31,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:31,514 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] [2025-03-08 06:01:31,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:31,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:31,519 INFO L85 PathProgramCache]: Analyzing trace with hash -983011031, now seen corresponding path program 1 times [2025-03-08 06:01:31,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:31,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299585975] [2025-03-08 06:01:31,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:31,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:31,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 06:01:31,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 06:01:31,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:31,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:31,710 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 06:01:31,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:31,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299585975] [2025-03-08 06:01:31,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299585975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:31,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:31,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 06:01:31,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83107488] [2025-03-08 06:01:31,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:31,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 06:01:31,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:31,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 06:01:31,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 06:01:31,737 INFO L87 Difference]: Start difference. First operand has 68 states, 66 states have (on average 1.7272727272727273) internal successors, (114), 67 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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:01:31,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:31,748 INFO L93 Difference]: Finished difference Result 105 states and 174 transitions. [2025-03-08 06:01:31,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 06:01:31,750 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-03-08 06:01:31,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:31,755 INFO L225 Difference]: With dead ends: 105 [2025-03-08 06:01:31,755 INFO L226 Difference]: Without dead ends: 65 [2025-03-08 06:01:31,757 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 06:01:31,759 INFO L435 NwaCegarLoop]: 109 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, 109 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 06:01:31,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:31,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-08 06:01:31,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-08 06:01:31,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.703125) internal successors, (109), 64 states have internal predecessors, (109), 0 states have call successors, (0), 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:01:31,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 109 transitions. [2025-03-08 06:01:31,787 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 109 transitions. Word has length 21 [2025-03-08 06:01:31,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:31,787 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 109 transitions. [2025-03-08 06:01:31,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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:01:31,788 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 109 transitions. [2025-03-08 06:01:31,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 06:01:31,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:31,789 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] [2025-03-08 06:01:31,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:01:31,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:31,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:31,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1493545208, now seen corresponding path program 1 times [2025-03-08 06:01:31,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:31,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361619036] [2025-03-08 06:01:31,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:31,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:31,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 06:01:31,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 06:01:31,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:31,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:32,012 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 06:01:32,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:32,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361619036] [2025-03-08 06:01:32,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361619036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:32,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:32,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:01:32,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964725623] [2025-03-08 06:01:32,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:32,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:01:32,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:32,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:01:32,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:01:32,016 INFO L87 Difference]: Start difference. First operand 65 states and 109 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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:01:32,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:32,074 INFO L93 Difference]: Finished difference Result 105 states and 170 transitions. [2025-03-08 06:01:32,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:01:32,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-03-08 06:01:32,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:32,078 INFO L225 Difference]: With dead ends: 105 [2025-03-08 06:01:32,078 INFO L226 Difference]: Without dead ends: 65 [2025-03-08 06:01:32,079 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 06:01:32,079 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:32,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 400 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:32,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-08 06:01:32,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-08 06:01:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.34375) internal successors, (86), 64 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:01:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2025-03-08 06:01:32,090 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 21 [2025-03-08 06:01:32,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:32,091 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2025-03-08 06:01:32,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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:01:32,091 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2025-03-08 06:01:32,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 06:01:32,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:32,092 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] [2025-03-08 06:01:32,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:01:32,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:32,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:32,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1079123086, now seen corresponding path program 1 times [2025-03-08 06:01:32,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:32,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139001581] [2025-03-08 06:01:32,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:32,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:32,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 06:01:32,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 06:01:32,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:32,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:32,315 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 06:01:32,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:32,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139001581] [2025-03-08 06:01:32,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139001581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:32,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:32,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:01:32,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373391461] [2025-03-08 06:01:32,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:32,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:01:32,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:32,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:01:32,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:01:32,318 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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:01:32,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:32,543 INFO L93 Difference]: Finished difference Result 353 states and 542 transitions. [2025-03-08 06:01:32,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:01:32,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-08 06:01:32,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:32,545 INFO L225 Difference]: With dead ends: 353 [2025-03-08 06:01:32,545 INFO L226 Difference]: Without dead ends: 317 [2025-03-08 06:01:32,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:01:32,547 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 461 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:32,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 870 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:01:32,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-08 06:01:32,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 99. [2025-03-08 06:01:32,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 98 states have internal predecessors, (140), 0 states have call successors, (0), 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:01:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2025-03-08 06:01:32,558 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 43 [2025-03-08 06:01:32,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:32,558 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2025-03-08 06:01:32,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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:01:32,559 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2025-03-08 06:01:32,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 06:01:32,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:32,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:32,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:01:32,560 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:32,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:32,560 INFO L85 PathProgramCache]: Analyzing trace with hash -829814099, now seen corresponding path program 1 times [2025-03-08 06:01:32,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:32,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559515612] [2025-03-08 06:01:32,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:32,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:32,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 06:01:32,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 06:01:32,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:32,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:32,663 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 06:01:32,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:32,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559515612] [2025-03-08 06:01:32,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559515612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:32,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:32,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:32,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833469515] [2025-03-08 06:01:32,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:32,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:32,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:32,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:32,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:32,664 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:32,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:32,686 INFO L93 Difference]: Finished difference Result 228 states and 343 transitions. [2025-03-08 06:01:32,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:32,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-08 06:01:32,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:32,687 INFO L225 Difference]: With dead ends: 228 [2025-03-08 06:01:32,688 INFO L226 Difference]: Without dead ends: 158 [2025-03-08 06:01:32,688 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 06:01:32,689 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 35 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:32,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 136 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:32,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-08 06:01:32,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2025-03-08 06:01:32,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.4709677419354839) internal successors, (228), 155 states have internal predecessors, (228), 0 states have call successors, (0), 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:01:32,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 228 transitions. [2025-03-08 06:01:32,698 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 228 transitions. Word has length 45 [2025-03-08 06:01:32,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:32,698 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 228 transitions. [2025-03-08 06:01:32,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:32,698 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 228 transitions. [2025-03-08 06:01:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 06:01:32,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:32,699 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:32,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:01:32,700 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:32,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:32,700 INFO L85 PathProgramCache]: Analyzing trace with hash -797490864, now seen corresponding path program 1 times [2025-03-08 06:01:32,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:32,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452466424] [2025-03-08 06:01:32,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:32,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:32,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 06:01:32,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 06:01:32,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:32,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:32,956 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 06:01:32,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:32,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452466424] [2025-03-08 06:01:32,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452466424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:32,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:32,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:01:32,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367327879] [2025-03-08 06:01:32,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:32,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:01:32,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:32,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:01:32,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:01:32,958 INFO L87 Difference]: Start difference. First operand 156 states and 228 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:33,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:33,059 INFO L93 Difference]: Finished difference Result 285 states and 428 transitions. [2025-03-08 06:01:33,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:01:33,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-08 06:01:33,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:33,060 INFO L225 Difference]: With dead ends: 285 [2025-03-08 06:01:33,060 INFO L226 Difference]: Without dead ends: 158 [2025-03-08 06:01:33,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:01:33,061 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 51 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:33,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 294 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:33,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-08 06:01:33,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2025-03-08 06:01:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.4580645161290322) internal successors, (226), 155 states have internal predecessors, (226), 0 states have call successors, (0), 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:01:33,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 226 transitions. [2025-03-08 06:01:33,081 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 226 transitions. Word has length 45 [2025-03-08 06:01:33,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:33,082 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 226 transitions. [2025-03-08 06:01:33,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:33,082 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 226 transitions. [2025-03-08 06:01:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 06:01:33,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:33,083 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] [2025-03-08 06:01:33,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:01:33,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:33,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:33,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1078124725, now seen corresponding path program 1 times [2025-03-08 06:01:33,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:33,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259913267] [2025-03-08 06:01:33,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:33,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:33,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 06:01:33,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 06:01:33,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:33,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:33,346 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 06:01:33,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:33,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259913267] [2025-03-08 06:01:33,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259913267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:33,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:33,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:01:33,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020660140] [2025-03-08 06:01:33,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:33,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:01:33,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:33,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:01:33,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:01:33,352 INFO L87 Difference]: Start difference. First operand 156 states and 226 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 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:01:33,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:33,387 INFO L93 Difference]: Finished difference Result 164 states and 235 transitions. [2025-03-08 06:01:33,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:01:33,388 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-03-08 06:01:33,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:33,389 INFO L225 Difference]: With dead ends: 164 [2025-03-08 06:01:33,389 INFO L226 Difference]: Without dead ends: 162 [2025-03-08 06:01:33,389 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 06:01:33,390 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:33,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 547 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:33,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-08 06:01:33,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-03-08 06:01:33,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.434782608695652) internal successors, (231), 161 states have internal predecessors, (231), 0 states have call successors, (0), 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:01:33,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 231 transitions. [2025-03-08 06:01:33,403 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 231 transitions. Word has length 46 [2025-03-08 06:01:33,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:33,404 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 231 transitions. [2025-03-08 06:01:33,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 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:01:33,404 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 231 transitions. [2025-03-08 06:01:33,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 06:01:33,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:33,408 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] [2025-03-08 06:01:33,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:01:33,408 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:33,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:33,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1763610702, now seen corresponding path program 1 times [2025-03-08 06:01:33,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:33,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267875098] [2025-03-08 06:01:33,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:33,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:33,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 06:01:33,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 06:01:33,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:33,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:33,466 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 06:01:33,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:33,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267875098] [2025-03-08 06:01:33,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267875098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:33,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:33,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:33,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438043402] [2025-03-08 06:01:33,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:33,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:33,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:33,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:33,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:33,468 INFO L87 Difference]: Start difference. First operand 162 states and 231 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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:01:33,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:33,481 INFO L93 Difference]: Finished difference Result 308 states and 452 transitions. [2025-03-08 06:01:33,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:33,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-08 06:01:33,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:33,482 INFO L225 Difference]: With dead ends: 308 [2025-03-08 06:01:33,482 INFO L226 Difference]: Without dead ends: 232 [2025-03-08 06:01:33,483 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 06:01:33,483 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 47 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:33,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 186 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:33,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-08 06:01:33,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2025-03-08 06:01:33,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 0 states have call successors, (0), 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:01:33,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 332 transitions. [2025-03-08 06:01:33,491 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 332 transitions. Word has length 47 [2025-03-08 06:01:33,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:33,491 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 332 transitions. [2025-03-08 06:01:33,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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:01:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 332 transitions. [2025-03-08 06:01:33,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 06:01:33,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:33,492 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] [2025-03-08 06:01:33,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:01:33,492 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:33,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:33,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1315665166, now seen corresponding path program 1 times [2025-03-08 06:01:33,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:33,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983494768] [2025-03-08 06:01:33,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:33,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:33,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 06:01:33,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 06:01:33,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:33,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:33,540 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 06:01:33,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:33,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983494768] [2025-03-08 06:01:33,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983494768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:33,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:33,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:33,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624328714] [2025-03-08 06:01:33,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:33,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:33,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:33,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:33,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:33,541 INFO L87 Difference]: Start difference. First operand 230 states and 332 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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:01:33,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:33,558 INFO L93 Difference]: Finished difference Result 604 states and 892 transitions. [2025-03-08 06:01:33,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:33,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-08 06:01:33,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:33,560 INFO L225 Difference]: With dead ends: 604 [2025-03-08 06:01:33,560 INFO L226 Difference]: Without dead ends: 405 [2025-03-08 06:01:33,560 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 06:01:33,561 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 45 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:33,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 192 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:33,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-08 06:01:33,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 403. [2025-03-08 06:01:33,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 402 states have (on average 1.4527363184079602) internal successors, (584), 402 states have internal predecessors, (584), 0 states have call successors, (0), 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:01:33,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 584 transitions. [2025-03-08 06:01:33,580 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 584 transitions. Word has length 47 [2025-03-08 06:01:33,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:33,581 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 584 transitions. [2025-03-08 06:01:33,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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:01:33,581 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 584 transitions. [2025-03-08 06:01:33,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 06:01:33,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:33,583 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] [2025-03-08 06:01:33,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:01:33,583 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:33,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:33,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1730841038, now seen corresponding path program 1 times [2025-03-08 06:01:33,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:33,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707040657] [2025-03-08 06:01:33,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:33,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:33,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 06:01:33,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 06:01:33,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:33,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:33,630 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 06:01:33,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:33,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707040657] [2025-03-08 06:01:33,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707040657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:33,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:33,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:33,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839759089] [2025-03-08 06:01:33,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:33,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:33,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:33,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:33,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:33,631 INFO L87 Difference]: Start difference. First operand 403 states and 584 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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:01:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:33,650 INFO L93 Difference]: Finished difference Result 1099 states and 1606 transitions. [2025-03-08 06:01:33,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:33,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-08 06:01:33,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:33,653 INFO L225 Difference]: With dead ends: 1099 [2025-03-08 06:01:33,653 INFO L226 Difference]: Without dead ends: 727 [2025-03-08 06:01:33,654 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 06:01:33,654 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 43 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:33,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 194 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-03-08 06:01:33,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 725. [2025-03-08 06:01:33,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 1.4364640883977902) internal successors, (1040), 724 states have internal predecessors, (1040), 0 states have call successors, (0), 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:01:33,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1040 transitions. [2025-03-08 06:01:33,688 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1040 transitions. Word has length 47 [2025-03-08 06:01:33,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:33,688 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1040 transitions. [2025-03-08 06:01:33,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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:01:33,688 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1040 transitions. [2025-03-08 06:01:33,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 06:01:33,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:33,689 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] [2025-03-08 06:01:33,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:01:33,689 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:33,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:33,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1244122766, now seen corresponding path program 1 times [2025-03-08 06:01:33,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:33,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959862366] [2025-03-08 06:01:33,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:33,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:33,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 06:01:33,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 06:01:33,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:33,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:33,751 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 06:01:33,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:33,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959862366] [2025-03-08 06:01:33,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959862366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:33,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:33,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:33,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254693868] [2025-03-08 06:01:33,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:33,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:33,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:33,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:33,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:33,754 INFO L87 Difference]: Start difference. First operand 725 states and 1040 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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:01:33,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:33,785 INFO L93 Difference]: Finished difference Result 2017 states and 2890 transitions. [2025-03-08 06:01:33,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:33,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-08 06:01:33,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:33,791 INFO L225 Difference]: With dead ends: 2017 [2025-03-08 06:01:33,791 INFO L226 Difference]: Without dead ends: 1323 [2025-03-08 06:01:33,792 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 06:01:33,793 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 41 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:33,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 196 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:33,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2025-03-08 06:01:33,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1321. [2025-03-08 06:01:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1320 states have (on average 1.406060606060606) internal successors, (1856), 1320 states have internal predecessors, (1856), 0 states have call successors, (0), 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:01:33,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1856 transitions. [2025-03-08 06:01:33,845 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1856 transitions. Word has length 47 [2025-03-08 06:01:33,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:33,845 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1856 transitions. [2025-03-08 06:01:33,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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:01:33,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1856 transitions. [2025-03-08 06:01:33,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:01:33,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:33,847 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:33,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:01:33,847 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:33,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:33,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1711699493, now seen corresponding path program 1 times [2025-03-08 06:01:33,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:33,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510900535] [2025-03-08 06:01:33,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:33,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:33,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:01:33,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:01:33,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:33,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:01:33,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:33,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510900535] [2025-03-08 06:01:33,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510900535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:33,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:33,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:01:33,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854995013] [2025-03-08 06:01:33,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:33,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:01:33,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:33,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:01:33,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:01:33,966 INFO L87 Difference]: Start difference. First operand 1321 states and 1856 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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:01:34,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:34,149 INFO L93 Difference]: Finished difference Result 6411 states and 9045 transitions. [2025-03-08 06:01:34,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:01:34,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 06:01:34,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:34,174 INFO L225 Difference]: With dead ends: 6411 [2025-03-08 06:01:34,174 INFO L226 Difference]: Without dead ends: 5481 [2025-03-08 06:01:34,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:01:34,179 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 330 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:34,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 494 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:34,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2025-03-08 06:01:34,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 2433. [2025-03-08 06:01:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2433 states, 2432 states have (on average 1.4013157894736843) internal successors, (3408), 2432 states have internal predecessors, (3408), 0 states have call successors, (0), 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:01:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 3408 transitions. [2025-03-08 06:01:34,307 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 3408 transitions. Word has length 64 [2025-03-08 06:01:34,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:34,308 INFO L471 AbstractCegarLoop]: Abstraction has 2433 states and 3408 transitions. [2025-03-08 06:01:34,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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:01:34,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 3408 transitions. [2025-03-08 06:01:34,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:01:34,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:34,309 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:34,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:01:34,310 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:34,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:34,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1263753957, now seen corresponding path program 1 times [2025-03-08 06:01:34,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:34,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286032941] [2025-03-08 06:01:34,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:34,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:34,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:01:34,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:01:34,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:34,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:34,448 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 06:01:34,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:34,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286032941] [2025-03-08 06:01:34,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286032941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:34,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:34,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:01:34,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319493096] [2025-03-08 06:01:34,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:34,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:01:34,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:34,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:01:34,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:01:34,450 INFO L87 Difference]: Start difference. First operand 2433 states and 3408 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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:01:34,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:34,661 INFO L93 Difference]: Finished difference Result 7699 states and 10853 transitions. [2025-03-08 06:01:34,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:01:34,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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 06:01:34,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:34,686 INFO L225 Difference]: With dead ends: 7699 [2025-03-08 06:01:34,686 INFO L226 Difference]: Without dead ends: 6409 [2025-03-08 06:01:34,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:01:34,691 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 330 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:34,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 488 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:01:34,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6409 states. [2025-03-08 06:01:34,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6409 to 4185. [2025-03-08 06:01:34,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4185 states, 4184 states have (on average 1.3977055449330784) internal successors, (5848), 4184 states have internal predecessors, (5848), 0 states have call successors, (0), 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:01:34,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4185 states to 4185 states and 5848 transitions. [2025-03-08 06:01:34,850 INFO L78 Accepts]: Start accepts. Automaton has 4185 states and 5848 transitions. Word has length 64 [2025-03-08 06:01:34,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:34,851 INFO L471 AbstractCegarLoop]: Abstraction has 4185 states and 5848 transitions. [2025-03-08 06:01:34,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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:01:34,851 INFO L276 IsEmpty]: Start isEmpty. Operand 4185 states and 5848 transitions. [2025-03-08 06:01:34,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:01:34,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:34,852 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:34,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:01:34,853 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:34,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:34,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1678929829, now seen corresponding path program 1 times [2025-03-08 06:01:34,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:34,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241303336] [2025-03-08 06:01:34,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:34,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:34,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:01:34,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:01:34,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:34,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:34,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 06:01:34,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:34,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241303336] [2025-03-08 06:01:34,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241303336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:34,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:34,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:01:34,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353894779] [2025-03-08 06:01:34,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:34,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:01:34,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:34,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:01:34,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:01:34,955 INFO L87 Difference]: Start difference. First operand 4185 states and 5848 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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:01:35,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:35,166 INFO L93 Difference]: Finished difference Result 8987 states and 12653 transitions. [2025-03-08 06:01:35,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:01:35,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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 06:01:35,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:35,189 INFO L225 Difference]: With dead ends: 8987 [2025-03-08 06:01:35,189 INFO L226 Difference]: Without dead ends: 7697 [2025-03-08 06:01:35,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:01:35,194 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 352 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:35,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 471 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:01:35,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7697 states. [2025-03-08 06:01:35,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7697 to 5473. [2025-03-08 06:01:35,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5473 states, 5472 states have (on average 1.3976608187134503) internal successors, (7648), 5472 states have internal predecessors, (7648), 0 states have call successors, (0), 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:01:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5473 states to 5473 states and 7648 transitions. [2025-03-08 06:01:35,369 INFO L78 Accepts]: Start accepts. Automaton has 5473 states and 7648 transitions. Word has length 64 [2025-03-08 06:01:35,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:35,370 INFO L471 AbstractCegarLoop]: Abstraction has 5473 states and 7648 transitions. [2025-03-08 06:01:35,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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:01:35,370 INFO L276 IsEmpty]: Start isEmpty. Operand 5473 states and 7648 transitions. [2025-03-08 06:01:35,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:01:35,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:35,374 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:35,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:01:35,374 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:35,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:35,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1192211557, now seen corresponding path program 1 times [2025-03-08 06:01:35,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:35,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130267555] [2025-03-08 06:01:35,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:35,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:35,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:01:35,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:01:35,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:35,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:35,473 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 06:01:35,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:35,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130267555] [2025-03-08 06:01:35,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130267555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:35,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:35,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:01:35,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500679006] [2025-03-08 06:01:35,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:35,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:01:35,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:35,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:01:35,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:01:35,475 INFO L87 Difference]: Start difference. First operand 5473 states and 7648 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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:01:35,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:35,711 INFO L93 Difference]: Finished difference Result 10275 states and 14453 transitions. [2025-03-08 06:01:35,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:01:35,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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 06:01:35,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:35,737 INFO L225 Difference]: With dead ends: 10275 [2025-03-08 06:01:35,737 INFO L226 Difference]: Without dead ends: 8985 [2025-03-08 06:01:35,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:01:35,742 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 344 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:35,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 481 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:01:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8985 states. [2025-03-08 06:01:36,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8985 to 6761. [2025-03-08 06:01:36,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6761 states, 6760 states have (on average 1.3976331360946745) internal successors, (9448), 6760 states have internal predecessors, (9448), 0 states have call successors, (0), 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:01:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6761 states to 6761 states and 9448 transitions. [2025-03-08 06:01:36,039 INFO L78 Accepts]: Start accepts. Automaton has 6761 states and 9448 transitions. Word has length 64 [2025-03-08 06:01:36,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:36,039 INFO L471 AbstractCegarLoop]: Abstraction has 6761 states and 9448 transitions. [2025-03-08 06:01:36,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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:01:36,039 INFO L276 IsEmpty]: Start isEmpty. Operand 6761 states and 9448 transitions. [2025-03-08 06:01:36,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 06:01:36,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:36,041 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] [2025-03-08 06:01:36,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:01:36,041 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:36,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:36,042 INFO L85 PathProgramCache]: Analyzing trace with hash -312527480, now seen corresponding path program 1 times [2025-03-08 06:01:36,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:36,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228257284] [2025-03-08 06:01:36,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:36,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:36,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 06:01:36,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 06:01:36,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:36,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:36,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:36,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228257284] [2025-03-08 06:01:36,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228257284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:36,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:36,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:36,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590460991] [2025-03-08 06:01:36,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:36,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:36,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:36,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:36,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:36,116 INFO L87 Difference]: Start difference. First operand 6761 states and 9448 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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 06:01:36,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:36,227 INFO L93 Difference]: Finished difference Result 13493 states and 18866 transitions. [2025-03-08 06:01:36,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:36,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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 06:01:36,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:36,239 INFO L225 Difference]: With dead ends: 13493 [2025-03-08 06:01:36,239 INFO L226 Difference]: Without dead ends: 6763 [2025-03-08 06:01:36,247 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 06:01:36,247 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 37 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:36,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 186 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:36,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2025-03-08 06:01:36,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6761. [2025-03-08 06:01:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6761 states, 6760 states have (on average 1.3792899408284023) internal successors, (9324), 6760 states have internal predecessors, (9324), 0 states have call successors, (0), 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:01:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6761 states to 6761 states and 9324 transitions. [2025-03-08 06:01:36,409 INFO L78 Accepts]: Start accepts. Automaton has 6761 states and 9324 transitions. Word has length 65 [2025-03-08 06:01:36,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:36,409 INFO L471 AbstractCegarLoop]: Abstraction has 6761 states and 9324 transitions. [2025-03-08 06:01:36,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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 06:01:36,414 INFO L276 IsEmpty]: Start isEmpty. Operand 6761 states and 9324 transitions. [2025-03-08 06:01:36,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:01:36,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:36,415 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] [2025-03-08 06:01:36,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:01:36,415 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:36,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:36,416 INFO L85 PathProgramCache]: Analyzing trace with hash 144484355, now seen corresponding path program 1 times [2025-03-08 06:01:36,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:36,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10473381] [2025-03-08 06:01:36,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:36,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:36,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:01:36,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:01:36,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:36,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:36,515 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:36,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:36,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10473381] [2025-03-08 06:01:36,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10473381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:36,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:36,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:36,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236361042] [2025-03-08 06:01:36,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:36,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:36,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:36,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:36,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:36,517 INFO L87 Difference]: Start difference. First operand 6761 states and 9324 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 06:01:36,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:36,567 INFO L93 Difference]: Finished difference Result 9334 states and 12908 transitions. [2025-03-08 06:01:36,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:36,567 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 06:01:36,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:36,573 INFO L225 Difference]: With dead ends: 9334 [2025-03-08 06:01:36,573 INFO L226 Difference]: Without dead ends: 2604 [2025-03-08 06:01:36,579 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 06:01:36,580 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 31 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:36,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 183 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:36,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2025-03-08 06:01:36,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 2596. [2025-03-08 06:01:36,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2596 states, 2595 states have (on average 1.373025048169557) internal successors, (3563), 2595 states have internal predecessors, (3563), 0 states have call successors, (0), 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:01:36,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2596 states to 2596 states and 3563 transitions. [2025-03-08 06:01:36,633 INFO L78 Accepts]: Start accepts. Automaton has 2596 states and 3563 transitions. Word has length 66 [2025-03-08 06:01:36,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:36,633 INFO L471 AbstractCegarLoop]: Abstraction has 2596 states and 3563 transitions. [2025-03-08 06:01:36,633 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 06:01:36,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2596 states and 3563 transitions. [2025-03-08 06:01:36,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:01:36,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:36,634 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:01:36,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:01:36,635 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:36,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:36,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1151726161, now seen corresponding path program 1 times [2025-03-08 06:01:36,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:36,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658400910] [2025-03-08 06:01:36,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:36,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:36,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:01:36,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:01:36,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:36,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:36,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:36,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658400910] [2025-03-08 06:01:36,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658400910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:36,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:36,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:36,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319068464] [2025-03-08 06:01:36,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:36,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:36,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:36,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:36,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:36,725 INFO L87 Difference]: Start difference. First operand 2596 states and 3563 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 06:01:36,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:36,756 INFO L93 Difference]: Finished difference Result 3876 states and 5325 transitions. [2025-03-08 06:01:36,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:36,757 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 06:01:36,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:36,760 INFO L225 Difference]: With dead ends: 3876 [2025-03-08 06:01:36,760 INFO L226 Difference]: Without dead ends: 1322 [2025-03-08 06:01:36,763 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 06:01:36,764 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 33 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:36,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 162 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:36,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2025-03-08 06:01:36,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2025-03-08 06:01:36,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.350265352539803) internal successors, (1781), 1319 states have internal predecessors, (1781), 0 states have call successors, (0), 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:01:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1781 transitions. [2025-03-08 06:01:36,797 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1781 transitions. Word has length 67 [2025-03-08 06:01:36,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:36,797 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1781 transitions. [2025-03-08 06:01:36,798 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 06:01:36,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1781 transitions. [2025-03-08 06:01:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 06:01:36,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:36,799 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] [2025-03-08 06:01:36,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:01:36,799 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:36,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:36,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2015928054, now seen corresponding path program 1 times [2025-03-08 06:01:36,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:36,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309285836] [2025-03-08 06:01:36,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:36,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:36,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 06:01:36,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 06:01:36,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:36,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:36,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:36,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309285836] [2025-03-08 06:01:36,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309285836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:36,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:36,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:36,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691932593] [2025-03-08 06:01:36,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:36,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:36,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:36,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:36,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:36,905 INFO L87 Difference]: Start difference. First operand 1320 states and 1781 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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:01:36,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:36,925 INFO L93 Difference]: Finished difference Result 1962 states and 2652 transitions. [2025-03-08 06:01:36,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:36,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-08 06:01:36,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:36,927 INFO L225 Difference]: With dead ends: 1962 [2025-03-08 06:01:36,927 INFO L226 Difference]: Without dead ends: 684 [2025-03-08 06:01:36,928 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 06:01:36,929 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 30 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:36,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 147 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:36,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-08 06:01:36,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 682. [2025-03-08 06:01:36,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 1.3230543318649046) internal successors, (901), 681 states have internal predecessors, (901), 0 states have call successors, (0), 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:01:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 901 transitions. [2025-03-08 06:01:36,946 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 901 transitions. Word has length 69 [2025-03-08 06:01:36,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:36,947 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 901 transitions. [2025-03-08 06:01:36,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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:01:36,947 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 901 transitions. [2025-03-08 06:01:36,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 06:01:36,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:36,948 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] [2025-03-08 06:01:36,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:01:36,948 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:36,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:36,948 INFO L85 PathProgramCache]: Analyzing trace with hash 698177885, now seen corresponding path program 1 times [2025-03-08 06:01:36,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:36,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134679284] [2025-03-08 06:01:36,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:36,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:36,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 06:01:36,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 06:01:36,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:36,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:39,291 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:39,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:39,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134679284] [2025-03-08 06:01:39,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134679284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:01:39,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643841864] [2025-03-08 06:01:39,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:39,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:39,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:01:39,295 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 06:01:39,297 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 06:01:39,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 06:01:39,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 06:01:39,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:39,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:39,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 06:01:39,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:01:39,939 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:01:39,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:01:40,763 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:01:40,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643841864] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:01:40,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:01:40,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-03-08 06:01:40,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382612081] [2025-03-08 06:01:40,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:01:40,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 06:01:40,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:40,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 06:01:40,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:01:40,765 INFO L87 Difference]: Start difference. First operand 682 states and 901 transitions. Second operand has 28 states, 28 states have (on average 6.571428571428571) internal successors, (184), 27 states have internal predecessors, (184), 0 states have call successors, (0), 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:01:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:43,388 INFO L93 Difference]: Finished difference Result 3864 states and 5198 transitions. [2025-03-08 06:01:43,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-08 06:01:43,389 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.571428571428571) internal successors, (184), 27 states have internal predecessors, (184), 0 states have call successors, (0), 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 71 [2025-03-08 06:01:43,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:43,394 INFO L225 Difference]: With dead ends: 3864 [2025-03-08 06:01:43,394 INFO L226 Difference]: Without dead ends: 3224 [2025-03-08 06:01:43,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1173 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=935, Invalid=4177, Unknown=0, NotChecked=0, Total=5112 [2025-03-08 06:01:43,396 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 1689 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:43,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 763 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:01:43,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3224 states. [2025-03-08 06:01:43,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3224 to 3124. [2025-03-08 06:01:43,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 3123 states have (on average 1.313480627601665) internal successors, (4102), 3123 states have internal predecessors, (4102), 0 states have call successors, (0), 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:01:43,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 4102 transitions. [2025-03-08 06:01:43,453 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 4102 transitions. Word has length 71 [2025-03-08 06:01:43,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:43,453 INFO L471 AbstractCegarLoop]: Abstraction has 3124 states and 4102 transitions. [2025-03-08 06:01:43,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.571428571428571) internal successors, (184), 27 states have internal predecessors, (184), 0 states have call successors, (0), 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:01:43,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 4102 transitions. [2025-03-08 06:01:43,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 06:01:43,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:43,454 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:43,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 06:01:43,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:43,659 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:43,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:43,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2015357357, now seen corresponding path program 1 times [2025-03-08 06:01:43,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:43,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396166392] [2025-03-08 06:01:43,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:43,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:43,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 06:01:43,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 06:01:43,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:43,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:43,946 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:43,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:43,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396166392] [2025-03-08 06:01:43,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396166392] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:01:43,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375824699] [2025-03-08 06:01:43,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:43,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:43,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:01:43,948 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:01:43,950 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:01:43,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 06:01:44,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 06:01:44,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:44,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:44,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 06:01:44,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:01:44,493 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:44,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:01:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:45,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375824699] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:01:45,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:01:45,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 31 [2025-03-08 06:01:45,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212355699] [2025-03-08 06:01:45,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:01:45,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 06:01:45,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:45,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 06:01:45,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2025-03-08 06:01:45,259 INFO L87 Difference]: Start difference. First operand 3124 states and 4102 transitions. Second operand has 32 states, 32 states have (on average 6.3125) internal successors, (202), 31 states have internal predecessors, (202), 0 states have call successors, (0), 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:01:47,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:47,126 INFO L93 Difference]: Finished difference Result 9834 states and 12957 transitions. [2025-03-08 06:01:47,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-08 06:01:47,127 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.3125) internal successors, (202), 31 states have internal predecessors, (202), 0 states have call successors, (0), 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 72 [2025-03-08 06:01:47,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:47,136 INFO L225 Difference]: With dead ends: 9834 [2025-03-08 06:01:47,136 INFO L226 Difference]: Without dead ends: 6752 [2025-03-08 06:01:47,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1247, Invalid=4759, Unknown=0, NotChecked=0, Total=6006 [2025-03-08 06:01:47,140 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 2339 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2339 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:47,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2339 Valid, 989 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:01:47,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6752 states. [2025-03-08 06:01:47,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6752 to 5676. [2025-03-08 06:01:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5676 states, 5675 states have (on average 1.2868722466960352) internal successors, (7303), 5675 states have internal predecessors, (7303), 0 states have call successors, (0), 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:01:47,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5676 states to 5676 states and 7303 transitions. [2025-03-08 06:01:47,250 INFO L78 Accepts]: Start accepts. Automaton has 5676 states and 7303 transitions. Word has length 72 [2025-03-08 06:01:47,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:47,250 INFO L471 AbstractCegarLoop]: Abstraction has 5676 states and 7303 transitions. [2025-03-08 06:01:47,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.3125) internal successors, (202), 31 states have internal predecessors, (202), 0 states have call successors, (0), 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:01:47,251 INFO L276 IsEmpty]: Start isEmpty. Operand 5676 states and 7303 transitions. [2025-03-08 06:01:47,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 06:01:47,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:47,252 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:01:47,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 06:01:47,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-08 06:01:47,456 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:47,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:47,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1098637914, now seen corresponding path program 1 times [2025-03-08 06:01:47,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:47,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136390376] [2025-03-08 06:01:47,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:47,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:47,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 06:01:47,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 06:01:47,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:47,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:47,742 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:47,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:47,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136390376] [2025-03-08 06:01:47,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136390376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:01:47,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432255565] [2025-03-08 06:01:47,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:47,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:47,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:01:47,745 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:01:47,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:01:47,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 06:01:47,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 06:01:47,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:47,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:47,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 06:01:47,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:01:48,269 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:48,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:01:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:48,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432255565] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:01:48,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:01:48,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2025-03-08 06:01:48,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349429093] [2025-03-08 06:01:48,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:01:48,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 06:01:48,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:48,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 06:01:48,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2025-03-08 06:01:48,892 INFO L87 Difference]: Start difference. First operand 5676 states and 7303 transitions. Second operand has 32 states, 32 states have (on average 5.6875) internal successors, (182), 32 states have internal predecessors, (182), 0 states have call successors, (0), 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:01:51,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:51,509 INFO L93 Difference]: Finished difference Result 22836 states and 29409 transitions. [2025-03-08 06:01:51,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-08 06:01:51,510 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.6875) internal successors, (182), 32 states have internal predecessors, (182), 0 states have call successors, (0), 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 73 [2025-03-08 06:01:51,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:51,571 INFO L225 Difference]: With dead ends: 22836 [2025-03-08 06:01:51,572 INFO L226 Difference]: Without dead ends: 17202 [2025-03-08 06:01:51,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1108, Invalid=5372, Unknown=0, NotChecked=0, Total=6480 [2025-03-08 06:01:51,581 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 2165 mSDsluCounter, 1808 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2165 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:51,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2165 Valid, 1908 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:01:51,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17202 states. [2025-03-08 06:01:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17202 to 10396. [2025-03-08 06:01:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10396 states, 10395 states have (on average 1.2778258778258778) internal successors, (13283), 10395 states have internal predecessors, (13283), 0 states have call successors, (0), 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:01:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10396 states to 10396 states and 13283 transitions. [2025-03-08 06:01:51,897 INFO L78 Accepts]: Start accepts. Automaton has 10396 states and 13283 transitions. Word has length 73 [2025-03-08 06:01:51,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:51,897 INFO L471 AbstractCegarLoop]: Abstraction has 10396 states and 13283 transitions. [2025-03-08 06:01:51,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.6875) internal successors, (182), 32 states have internal predecessors, (182), 0 states have call successors, (0), 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:01:51,897 INFO L276 IsEmpty]: Start isEmpty. Operand 10396 states and 13283 transitions. [2025-03-08 06:01:51,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 06:01:51,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:51,899 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:01:51,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 06:01:52,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:52,104 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:52,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:52,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1889108664, now seen corresponding path program 1 times [2025-03-08 06:01:52,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:52,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853077929] [2025-03-08 06:01:52,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:52,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:52,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 06:01:52,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 06:01:52,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:52,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:53,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:53,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853077929] [2025-03-08 06:01:53,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853077929] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:01:53,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691288480] [2025-03-08 06:01:53,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:53,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:53,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:01:53,515 INFO L229 MonitoredProcess]: Starting monitored process 5 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:01:53,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 06:01:53,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 06:01:53,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 06:01:53,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:53,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:53,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-08 06:01:53,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:01:57,613 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:57,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:02:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:02:02,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691288480] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:02:02,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:02:02,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 29, 27] total 77 [2025-03-08 06:02:02,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096808028] [2025-03-08 06:02:02,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:02:02,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2025-03-08 06:02:02,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:02,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2025-03-08 06:02:02,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=5239, Unknown=0, NotChecked=0, Total=5852 [2025-03-08 06:02:02,572 INFO L87 Difference]: Start difference. First operand 10396 states and 13283 transitions. Second operand has 77 states, 77 states have (on average 2.675324675324675) internal successors, (206), 77 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)